On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
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
Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
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
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
A correction of the termination conditions of the Henschen-Naqvi technique
Journal of the ACM (JACM)
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Prolog-Based Meta-rules for Relational Database Representation and Manipulation
IEEE Transactions on Software Engineering
On tree-based techniques for query evaluation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Path queries for transportation networks: dynamic reordering and sliding window paging techniques
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Semigroup techniques in recursive query optimization
PODS '90 Proceedings of the ninth 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
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A generalized transitive closure for relational queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of relational algebra expressions containing recursion operators
CSC '91 Proceedings of the 19th annual conference on Computer Science
Moving Selections into Linear Least Fixpoint Queries
IEEE Transactions on Knowledge and Data Engineering
Classification and Compilation of Linear Recursive Queries in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A Study on the Structure of Linear Recursion
IEEE Transactions on Knowledge and Data Engineering
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Description and Identification of Distributed Fragments of Recursive Relations
IEEE Transactions on Knowledge and Data Engineering
RQL: A Recursive Query Language
IEEE Transactions on Knowledge and Data Engineering
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Distributed Transitive Closure Computations: The Disconnection Set Approach
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Hybrid Transitive Closure Algorithms
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Description logics for semantic query optimization in object-oriented database systems
ACM Transactions on Database Systems (TODS)
Transitive closure and recursive Datalog implemented on clusters
Proceedings of the 15th International Conference on Extending Database Technology
| Hi-index | 0.00 |
We show that every linearly recursive query can be expressed as a transitive closure possibly preceded and followed by operations already available in relational algebra. This reduction is possible even if there are repeated variables in the recursive literals and if some of the arguments in the recursive literals are constants. Such an equivalence has significant theoretical and practical ramifications. One the one hand it influences the design of expressive notations to capture recursion as an augmentation of relational query languages. On the other hand implementation of deductive databases is impacted in that the design does not have to provide the generality that linear recursion would demand. It suffices to study the single problem of transitive closure and to provide an efficient implementation for it.