On the Expected Size of Recursive Datalog Queries
Summary: Asymptotically exact formulas for expected fixpoint sizes of two Datalog recursions (same-generation, canonical factorable) and of their Magic Sets/Factoring rewrites under selection queries. Finds recursive relations near worst-case even on sparse bases; Magic Sets yields sizes within a small constant of no-rewrite, while Factoring (when applicable) yields much smaller relations—analytic formulas closely match experiments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,255 | Queries are easier than you thought (probably) | 1992 | PODS | 5.1367617e-05 |
| 10,404 | Dynamic Pruning for Recursive Joins | 2025 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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.0010066783 |
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
| 1,712 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 0.00010804573 |
| 4,555 | Magic Counting Methods | 1987 | SIGMOD | 6.0891017e-05 |
| 5,515 | Worst-case Complexity Analysis of Methods for Logic Query Implementation | 1987 | PODS | 5.4636431e-05 |
| 7,156 | Counting Methods for Cyclic Relations | 1988 | PODS | 4.8145046e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 688 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00018134733 |
| 4,178 | Argument Reduction by Factoring | 1989 | VLDB | 6.3812002e-05 |
| 296 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028644922 |
| 6,254 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD | 5.1368042e-05 |
| 4,555 | Magic Counting Methods | 1987 | SIGMOD | 6.0891017e-05 |
| 431 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023370207 |
| 12,904 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS | 4.1945683e-05 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 9,834 | Magic Functions : A Technique To Optimize Extended Datalog Recursive Programs | 1987 | VLDB | 4.2751057e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |