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)
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
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
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
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
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
LDL: A Logic-Based Data Language
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Linearising nonlinear recursions in polynomial time
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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 new proof of undecidability of safety of logic queries
ACM SIGACT News
On the expected size of recursive Datalog queries
PODS '91 Proceedings of the tenth 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
Deductive database languages: problems and solutions
ACM Computing Surveys (CSUR)
An experimental performance study of a pipelined recursive query processing strategy
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
An introduction to deductive database languages and systems
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Moving Selections into Linear Least Fixpoint Queries
IEEE Transactions on Knowledge and Data Engineering
COMPLEX: An Object-Oriented Logic Programming System
IEEE Transactions on Knowledge and Data Engineering
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
Right-, left- and multi-linear rule transformations that maintain context information
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Speeding up the counting method by computing heritage functions in topological order
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.00 |
The problem considered is that of implementing recursive queries, expressed in a logic-based language, by efficient fixpoint computations. In particular, the situation is studied where the initial bindings in the recursive predicate can be used to restrict the search space and ensure safety of execution. Two key techniques previously proposed to solve this problem are (i) the highly efficient counting method, and (ii) the magic set method which is safe in a wider range of situations than (i). In this paper, we present a family of methods, called the magic counting methods, that combines the advantages of (i) and (ii). This is made possible by the similarity of the strategies used by the counting method and the magic set method for propagating the bindings. This paper introduces these new methods, examines their computational complexity, and illustrates the trade-offs between the family members and their superiority with respect to the old methods.