Efficient Evaluation of Right-, Left-, and Multi-Linear Rules
Summary: Efficient evaluation of recursive queries via a rewriting phase (like magic sets) and semi-naive bottom-up evaluation. Yields O(n) speedup over magic sets on a broad class of recursions by arity-reducing the recursive predicates in transformed rules. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. J. F. Naughton (Princeton University)
- 2. R. Ramakrishnan (IBM; University of Wisconsin)
- 3. Y. Sagiv (Hebrew University; Stanford University)
- 4. J. D. Ullman (Stanford University)
BibTeX Citation
@inproceedings{naughton_sigmod89,
title = {{Efficient Evaluation of Right-, Left-, and Multi-Linear Rules}},
author = {Naughton, J. F. and Ramakrishnan, R. and Sagiv, Y. and Ullman, J. D.},
series = {{SIGMOD} '89},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/67544.66948},
url = {https://dl.acm.org/doi/10.1145/67544.66948},
year = {1989}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00060089598 |
| 217 | Traversal Recursion: A Practical Approach to Supporting Recursive Applications | 1986 | SIGMOD | 0.00024458594 |
| 313 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.0002168869 |
| 344 | On the Power of Magic | 1987 | PODS | 0.00020659405 |
| 2,033 | One-Sided Recursions | 1987 | PODS | 9.2819369e-05 |
| 3,629 | Compiling Separable Recursions | 1988 | SIGMOD | 7.2392728e-05 |
| 9,503 | Counting Methods for Cyclic Relations | 1988 | PODS | 5.2586367e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 344 | On the Power of Magic | 1987 | PODS |
| 2 | 6,008 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD |
| 3 | 3,629 | Compiling Separable Recursions | 1988 | SIGMOD |
| 4 | 3,603 | Overbound and Right-Linear Queries | 1991 | PODS |
| 5 | 4,425 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS |
| 6 | 1,410 | Magic is Relevant | 1990 | SIGMOD |
| 7 | 7,131 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS |
| 8 | 6,729 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB |
| 9 | 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS |
| 10 | 3,767 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB |