On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Updating derived relations: detecting irrelevant and autonomously computable updates
ACM Transactions on Database Systems (TODS)
Linearization of Nonlinear Recursive Rules
IEEE Transactions on Software Engineering
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
Analytical modeling of materialized view maintenance
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
IEEE Transactions on Knowledge and Data Engineering
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
Proceedings of the Third International Conference on Data Engineering
Real Time Retrieval and Update of Materialized Transitive Closure
Proceedings of the Seventh International Conference on Data Engineering
Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation
Proceedings of the Third International Conference on Data Engineering
A Parallel Processing Strategy for Evaluating Recursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
A Parallel Scheme Using the Divide-and-Conquer Method
Distributed and Parallel Databases
| Hi-index | 0.00 |
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.