On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Naive evaluation of recursively defined relations
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
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
The generalized counting method for recursive logic queries
Proceedings on International conference on database theory
Filtering data flow in deductive databases
Proceedings on International conference on database theory
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Operations on sparse relations
Communications of the ACM
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A correction of the termination conditions of the Henschen-Naqvi technique
Journal of the ACM (JACM)
An optimal graph traversal algorithm for evaluating linear binary-chain programs
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Magic factoring of closure programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Counting methods for cyclic relations
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
On the Graph Traversal and Linear Binary-Chain Programs
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Well-known results on graph traversal are used to develop a practical, efficient algorithm for evaluating regularly and linearly recursive queries in databases that contain only binary relations. Transformations are given that reduce a subset of regular and linear queries involving n-ary relations (n 2) to queries involving only binary relations.