Efficient evaluation of right-, left-, and multi-linear rules

Authors:
J. F. Naughton;R. Ramakrishnan;Y. Sagiv;J. D. Ullman
Affiliations:
Department of Computer Science, Princeton University;Department of Computing Sciences, University of Wisconsin, Madison, Wisconsin;Department of Computing Sciences, Hebrew University, Jerusalem, Israel;Stanford University.
Venue:
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Year:
1989

Citing 12
Cited 34

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
The generalized counting method for recursive logic queries

Proceedings on International conference on database theory
Traversal recursion: a practical approach to supporting recursive applications

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
On the power of magic

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
One-sided recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Compiling separable recursions

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Performance evaluation of data intensive logic programs

Foundations of deductive databases and logic programming
Optimizing datalog programs

Foundations of deductive databases and logic programming
Counting methods for cyclic relations

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries

Proceedings of the Third International Conference on Data Engineering

Estimating the size of generalized transitive closures

VLDB '89 Proceedings of the 15th international conference on Very large data bases
Argument reduction by factoring

VLDB '89 Proceedings of the 15th international conference on Very large data bases
Modular acyclicity and tail recursion in logic programs

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Overbound and right-linear queries

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reactive consistency control in deductive databases

ACM Transactions on Database Systems (TODS)
Efficient Evaluation of Multiple Linear Recursions

IEEE Transactions on Software Engineering
On the equivalence of recursive and nonrecursive datalog programs

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On tree-based techniques for query evaluation

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A performance study of transitive closure algorithms

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Decomposition of magic rewriting

Journal of the ACM (JACM)
Space optimization in deductive databases

ACM Transactions on Database Systems (TODS)
Tail recursion elimination in deductive databases

ACM Transactions on Database Systems (TODS)
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments

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
Program Partition and Logic Program Analysis

IEEE Transactions on Software Engineering
Extending SQL with Generalized Transitive Closure

IEEE Transactions on Knowledge and Data Engineering
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries

IEEE Transactions on Knowledge and Data Engineering
Binding Propagation in Disjunctive Databases

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Factoring Augmented Regular Chain Programs

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Right-, left- and multi-linear rule transformations that maintain context information

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
SLDMagic - The Real Magic (With Applications to Web Queries)

CL '00 Proceedings of the First International Conference on Computational Logic
Soft stratification for magic set based query evaluation in deductive databases

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A front-end to deductive database systems for multiparadigm programming

SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Optimizing existential queries in stratifiable deductive databases

Proceedings of the 2005 ACM symposium on Applied computing
On Simplification of Database Integrity Constraints

Fundamenta Informaticae
Chase of recursive queries

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Using datalog with binary decision diagrams for program analysis

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Incremental integrity checking: limitations and possibilities

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient integrity checking for databases with recursive views

ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
On Simplification of Database Integrity Constraints

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets transformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of &Ogr;(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.