Bottom-Up Beats Top-Down For Datalog
Summary: For any safe Datalog program P1 and any query Q (a predicate with some bound arguments), there exists a safe Datalog program P2 that computes Q’s answers. Semi-naive bottom-up evaluation of P2 takes no more time than top-down evaluation of P1. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 990 | Relational Transducers for Electronic Commerce | 1998 | PODS | 0.00014800793 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012271947 |
| 3,589 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB | 6.9387274e-05 |
| 4,120 | Context-Sensitive Program Analysis as Database Queries | 2005 | PODS | 6.4306149e-05 |
| 4,401 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.2096576e-05 |
| 5,637 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.3978567e-05 |
| 6,253 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD | 5.1318715e-05 |
| 6,881 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8929836e-05 |
| 12,899 | Implementing Deductive Databases by Linear Programming | 1992 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 64 | A Message Passing Framework for Logical Query Evaluation | 1986 | SIGMOD | 0.00063295728 |
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,813 | Optimizing Nested Recursive Queries | 2024 | SIGMOD | 4.2742278e-05 |
| 2,087 | A Framework for the Parallel Processing of Datalog Queries | 1990 | SIGMOD | 9.5715836e-05 |
| 3,860 | On Distributed Processibility of Datalog Queries by Decomposing Databases | 1989 | SIGMOD | 6.6864693e-05 |
| 4,138 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4127061e-05 |
| 10,932 | Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs | 2024 | PODS | 4.1905499e-05 |
| 6,665 | Selective Provenance for Datalog Programs Using Top-K Queries | 2015 | VLDB | 4.9657158e-05 |
| 2,912 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.9261665e-05 |
| 6,253 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD | 5.1318715e-05 |
| 5,996 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2365238e-05 |
| 5,637 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.3978567e-05 |