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)

Paper ID: 943
Venue: PODS
Year: 1991
Pagerank: 5.7306589e-05
Overall Rank: 6,948 | 52.34%
DOI: 10.1145/113413.113438

Incoming Non-self Citations Over Time

Authors

1. S. Seshadri (University of Wisconsin)
2. Jeffrey F. Naughton (University of Wisconsin)

BibTeX Citation

@inproceedings{seshadri_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{On the Expected Size of Recursive Datalog Queries}},
        url = {https://dl.acm.org/doi/10.1145/113413.113438},
        doi = {10.1145/113413.113438},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Seshadri, S. and Naughton, Jeffrey F.},
        year = {1991}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,558	Queries are easier than you thought (probably)	1992	PODS	5.8396421e-05
10,690	Dynamic Pruning for Recursive Joins	2025	SIGMOD	5.093636e-05

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.00060089598
344	On the Power of Magic	1987	PODS	0.00020659405
1,653	Bounds on the Propagation of Selection into Logic Programs	1987	PODS	0.000101081
4,337	Magic Counting Methods	1987	SIGMOD	6.7554367e-05
5,295	Worst-case Complexity Analysis of Methods for Logic Query Implementation	1987	PODS	6.2784683e-05
9,503	Counting Methods for Cyclic Relations	1988	PODS	5.2586367e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,382	Estimating the Size of Generalized Transitive Closures	1989	VLDB
2	429	On the Implementation of a Simple Class of Logic Queries for Databases	1986	PODS
3	6,008	More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets	2011	SIGMOD
4	4,337	Magic Counting Methods	1987	SIGMOD
5	414	On the Complexity of Database Queries (Extended Abstract)	1997	PODS
6	10,148	Size Bound-Adorned Datalog	2026	PODS
7	13,099	Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases	1991	PODS
8	1,921	Efficient Evaluation of Right-, Left-, and Multi-Linear Rules	1989	SIGMOD
9	9,981	Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs	1987	VLDB
10	6,613	Inherent Complexity of Recursive Queries (Extended Abstract)	1999	PODS