Database Paper Browser

Back to papers

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)

Paper ID
1957
Venue
PODS
Year
2024
Pagerank
4.1905499e-05
Overall Rank
10,932 | 24.03%
DOI
10.1145/3695839

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
31 Provenance Semirings 2007 PODS 0.00078516827
564 FAQ: Questions Asked Frequently 2016 PODS 0.00020002796
2,912 Convergence of Datalog over (Pre-) Semirings 2022 PODS 7.9261665e-05
Previous Page 1 / 1 Next

Semantically Similar Papers