On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
On the implementation of a simple class of logic queries for databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Efficient evaluation for a subset of recursive queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Worst-case complexity analysis of methods for logic query implementation
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Recursive query processing: the power of logic
Theoretical Computer Science
Decomposing a relation into a tree of binary relations
Journal of Computer and System Sciences
Journal of Logic Programming
Efficient evaluation for a subset of recursive queries
Journal of Logic Programming
Comparison of methods for logic-query implementation
Journal of Logic Programming
Abstract interpretation based on OLDT resolution
Journal of Logic Programming
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Fifth International Conference on Data Engineering
A Bottom-up Query Evaluation Method for Stratified Databases
Proceedings of the Ninth International Conference on Data Engineering
Normalization of Linear Recursions in Deductive Databases
Proceedings of the Ninth International Conference on Data Engineering
Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
On the Optimal Top-down Evaluation of Recursive Queries
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
| Hi-index | 0.01 |
Grahne et al. have presented a graph algorithm for evaluating a subset of recursive queries. This method consists of two phases. In the first phase, the method transforms a linear binary-chain program into a set of equations over expressions containing predicate symbols. In the second phase, a graph is constructed from the equations and the answers are produced by traversing the relevant paths. Here, we describe a new algorithm which requires less time than Grahne's. The key idea of the improvement is to reduce the search space that will be traversed when a query is invoked. Furthermore, we speed up the evaluation of cyclic data by generating most answers directly in terms of the answers already found and the associated 驴path information驴 instead of traversing the corresponding paths as usual. In this way, our algorithm achieves a linear time complexity for both acyclic and cyclic data.