Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments

A data structure is used to store materialized generalized transitive closure so that the evaluation of generalized transitive closure queries, deletions, and insertions of tuples can be performed efficiently in centralized and parallel environments. Some techniques to manage materialized transitive closure are presented and generalized to more general recursions. The proposed algorithms and the associated data structures are simple conceptually and in implementation. In a multiprocessor environment, the time complexities for insertion and deletion of the authors schemes are reduced. Only two rounds of communication are needed. >

[1]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[2]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[3]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[4]  Jaideep Srivastava,et al.  Analytical modeling of materialized view maintenance , 1988, PODS '88.

[5]  Stanley Y. W. Su,et al.  A Parallel Processing Strategy for Evaluating Recursive Queries , 1986, VLDB.

[6]  Chin-Liang Chang.  On Evaluation of Queries Containing Derived Relations in a Relational Data Base , 1979, Advances in Data Base Theory.

[7]  H. V. Jagadish,et al.  A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing , 1988, Expert Database Conf..

[8]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

[9]  Abraham Silberschatz,et al.  Distributed processing of logic programs , 1988, SIGMOD '88.

[10]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[11]  Rakesh Agrawal.  Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries , 1988, IEEE Trans. Software Eng..

[12]  Clement T. Yu,et al.  Necessary and sufficient conditions to linearize doubly recursive programs in logic databases , 1990, TODS.

[13]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[14]  Patrick Lincoln,et al.  Efficient implementation of lattice operations , 1989, TOPL.

[15]  Richard J. Enbody,et al.  Dynamic hashing schemes , 1988, CSUR.

[16]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

[17]  Clement T. Yu,et al.  Linearization of Nonlinear Recursive Rules , 1989, IEEE Trans. Software Eng..

[18]  Allen Van Gelder,et al.  A message passing framework for logical query evaluation , 1986, SIGMOD '86.

[19]  Per-Åke Larson,et al.  Updating derived relations: detecting irrelevant and autonomously computable updates , 1986, VLDB.

[20]  Jiawei Han,et al.  Asynchronous Chain Recursions , 1989, IEEE Trans. Knowl. Data Eng..

[21]  Clement T. Yu,et al.  Evaluation of transitive closure in distributed database systems , 1989, IEEE J. Sel. Areas Commun..

[22]  Lawrence J. Henschen,et al.  On compiling queries in recursive first-order databases , 1984, JACM.

[23]  Clement T. Yu,et al.  Real time retrieval and update of materialized transitive closure , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[24]  Hongjun Lu,et al.  Design and evaluation of algorithms to compute the transitive closure of a database relation , 1987, 1987 IEEE Third International Conference on Data Engineering.

[25]  H. V. Jagadish,et al.  A study of transitive closure as a recursion mechanism , 1987, SIGMOD '87.

[26]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[27]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.