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
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient evaluation for a subset of recursive queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A file structure supporting traversal recursion
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
Linearization of Nonlinear Recursive Rules
IEEE Transactions on Software Engineering
Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Parallel transitive closure computations using topological sort
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Principles of Database Systems
Principles of Database Systems
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
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)
| Hi-index | 0.00 |
We study the complexity of processing a class of rules called simple binary rule sets. The data referenced by the rules are stored in secondary memory. A necessary and sufficient condition that a simple binary rule set can be processed in a single pass of a file containing the base relations is given. Because not all simple binary rule sets can be processed in a single pass, a necessary and sufficient condition that a simple binary rule set can be processed by a constant number of passes is also given.