Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
Summary: Datalog◦ extends Datalog with aggregation/recursion over commutative semirings; iterative evaluation converges on p-stable semirings. New bound: O(σ p n^2(n^2 log λ + log σ)) iterations; improves prior Θ(p^n) to polynomial time. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sungjin Im (University of California at Santa Cruz)
- 2. Benjamin Moseley (Carnegie Mellon University)
- 3. Hung Q. Ngo (RelationalAI)
- 4. Kirk Pruhs (University of Pittsburgh)
BibTeX Citation
@inproceedings{im_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs}},
url = {https://dl.acm.org/doi/10.1145/3695839},
doi = {10.1145/3695839},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Im, Sungjin and Moseley, Benjamin and Ngo, Hung Q. and Pruhs, Kirk},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 17 | Provenance Semirings | 2007 | PODS | 0.00059843817 |
| 358 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020243592 |
| 2,600 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 8.3571843e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,051 | CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract) | 1986 | PODS |
| 2 | 3,245 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS |
| 3 | 6,209 | On Datalog vs. Polynomial Time | 1991 | PODS |
| 4 | 953 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS |
| 5 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 6 | 10,148 | Size Bound-Adorned Datalog | 2026 | PODS |
| 7 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 8 | 10,640 | Circuits and Formulas for Datalog over Semirings | 2025 | PODS |
| 9 | 6,301 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS |
| 10 | 2,600 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS |