Abstract
Explicitly storing the transitive closure of a relation appears to be a solution providing fast access to recursively defined data. However, update propagations then have to be efficiently processed. This paper focuses on the minimization of the cost of the propagation of the updates from the basic relation to the deduced relation. Only a part of the transitive closure relation is influenced by the basic modification and has to be recomputed; the rest of the transitive closure remains untouched. Basic algorithms for instance- oriented propagations of insertion and deletion are proposed. Moreover, this paper investigates the consideration of set- oriented updates directly. We take into account a set of deleted and/or inserted tuples in a single manipulation. The proposed method maintains an arbitary set- oriented update in less than 2 passes over the transitive closure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.E. Adiba, B.G. Lindsay: “Database Snapshots” In Proceedings 6th International Conference on Very Large Data Bases, Montreal, October 1980.
R. Agrawal, A. Borgida, H.V. Jagadish: “Efficient Management of Transitive Relationships in Large Data and Knowledge Bases”, In Proceedings ACM SIGMOD 1989 International Conference on Management of Data, Portland, USA, May 1989.
R. Agrawal, S. Dar, H.V. Jagadish: “Direct Transitive Closure Algorithms: Design and Performance Evaluation”, ACM Transactions on Database Systems, Vol. 15, N∘3, September 1990.
F. Bancilhon, R. Ramakrishnan: “An Amateur's Introduction To Recursive Query Processing Strategies”, In Proceedings ACM SIGMOD 1986 International Conference on Management of Data, Washington, USA, May 1986.
J.A. Blakeley, P.A. Larson, F.W. Tompa: “Efficiently Updating Materialized Views”, In Proceedings ACM SIGMOD 1986 International Conference on Management of Data, Washington, USA, May 1986.
O.P. Buneman, O. Peter, E. K, Climons:“Efficiently Monitoring Relational Database” ACM Transactions on Database Systems, Vol. 4, N∘3, September 1979.
S. Ceri, G. Gottlob, L. Tanca: “Logic Programming and Databases”, Springer Verlag, 1990.
J.P. Cheiney, C. de Maindreville: “A Parallel Stategy For Transitive Closure Using Double Hash-based Clustering”, In Proceedings 16th International Conference on Very Large Data Bases, Brisbane, Australia, August 1990.
G. Gardarin, E. Simon, L. Verlaine: “Querying Real Time Relational Data Bases”, In Proceedings IEEE-ICC International Conference, Amsterdam, The Nederlands, May 1984.
K.C. Guh, C. Sun, C. Yu: “Real Time Retrieval and Update of Materialized Transitive Closure”, In Proceedings 7th IEEE International Conference on Data Engineering, Kobe, Japan, April 1991.
M.A. Houtsma, P.M. Apers, S. Ceri: “Distributed Transitive Closure Computation: the Disconnection Set Approach” In Proceedings 16th International Conference on Very Large Data Bases, Brisbane, Australia, August 1990.
Y.N. Huang, J.P. Cheiney: “Parallel Computation of Direct Transitive Closures”, In Proceedings 7th IEEE International Conference on Data Engineering, Kobe, Japan, April 1991.
Y. Ioannidis, R. Ramakrishnan; “Efficient Transitive Closure Algorithms” In Proceedings 14th International Conference on Very Large Data Bases, Los Angeles, USA, August 1988.
H. V. Jagadish: “A Compression Technique to Materialize Transitive Closure”, ACM Transactions on Database Systems, Vol. 15, N∘4, 1990.
H. Lu: “New Strategies for Computing the Transitive Closure of a Database Relation”, In Proceeding 12th International Conference on Very Large Data Bases, Brighton, England, September 1987.
J.-M. Nicolas, K. Yazdanian: “An Outline of BDGEN: a Deductive DBMS”, In Proceedings IFIP World Congress, Noth-Holland, Amsterdam, 1983.
R. Paige, S. Koenig: “Finite differencing of Computable Expressions”, ACM Transactions on Programming Languages and Systems, Vol. 4, N∘3, 1982.
L. Raschid, S.Y. Su: “A Parallel Strategy for Evaluating recursive queries” In Proceedings 11 th International Conference on Very Large Data Bases, Kyoto, Japan, August 1986.
M. Roesler, W. Burkhard: “Deadlock Resolution and Semantic Lock Models in Objetc-Oriented Distributed Systems”, In Proceedings ACM-SIGMOD 1988 International Conference on Management of Data, Chicago, June 1988.
A. Rosenthal, S. Heiler, U. Dayal and F. Manola: “Traversal Recursion: a Practical Approach to Supporting Recursive Applications”, In Proceedings ACM-SIGMOD 1986, International Conference on Management of Data, Washinghton, USA, May 1986.
P. Valduriez, S. Koshafian: “Parallel Evaluation of the Transitive Closure of a Database Relation”, International Journal of Parallel Programming, Vol. 17, N∘1, February 1988.
E.S Warren: “A modification of Warshall's Algorithm for the Transitive Closure of Binary Relations”, Communications of the ACM, Vol. 18, N∘4, April 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheiney, JP., Huang, YN. (1991). Set-oriented propagation of updates into transitively closed relations. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-55015-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55015-0
Online ISBN: 978-3-540-46646-8
eBook Packages: Springer Book Archive