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 |
|---|---|---|---|---|
| 989 | Relational Transducers for Electronic Commerce | 1998 | PODS | 0.00014814282 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 3,585 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB | 6.9454028e-05 |
| 4,118 | Context-Sensitive Program Analysis as Database Queries | 2005 | PODS | 6.4368597e-05 |
| 4,405 | On Preservation under Homomorphisms and Unions of Conjunctive Queries | 2004 | PODS | 6.2156238e-05 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
| 6,254 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD | 5.1368042e-05 |
| 6,876 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8977465e-05 |
| 12,889 | Implementing Deductive Databases by Linear Programming | 1992 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 63 | A Message Passing Framework for Logical Query Evaluation | 1986 | SIGMOD | 0.00063714145 |
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,814 | Optimizing Nested Recursive Queries | 2024 | SIGMOD | 4.2783272e-05 |
| 2,079 | A Framework for the Parallel Processing of Datalog Queries | 1990 | SIGMOD | 9.5979932e-05 |
| 3,855 | On Distributed Processibility of Datalog Queries by Decomposing Databases | 1989 | SIGMOD | 6.6953401e-05 |
| 4,136 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4188795e-05 |
| 10,929 | Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs | 2024 | PODS | 4.1945683e-05 |
| 6,662 | Selective Provenance for Datalog Programs Using Top-K Queries | 2015 | VLDB | 4.9704872e-05 |
| 2,907 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.933806e-05 |
| 6,254 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD | 5.1368042e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |