Circuits and Formulas for Datalog over Semirings
Summary: Datalog provenance polynomials over absorptive semirings; analyzes optimal circuit/formula depth and size as a function of input m. Dichotomy for several Datalog classes: polynomial-size formulas exist or not; depth Theta(log m) vs Theta(log^2 m); polynomial fringe yields O(log^2 m) circuits; semiring-boundedness characterizations. (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. Austen Z. Fan (University of Wisconsin)
- 2. Paraschos Koutris (University of Wisconsin)
- 3. Sudeepa Roy (Duke University)
BibTeX Citation
@inproceedings{fan_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Circuits and Formulas for Datalog over Semirings}},
url = {https://dl.acm.org/doi/10.1145/3725230},
doi = {10.1145/3725230},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Fan, Austen Z. and Koutris, Paraschos and Roy, Sudeepa},
year = {2025}
}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 10 of 10 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.00059752575 |
| 356 | Regular Path Queries with Constraints | 1997 | PODS | 0.00020103855 |
| 1,201 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00011560838 |
| 1,830 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.5498891e-05 |
| 2,062 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.0974416e-05 |
| 2,630 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 8.2027684e-05 |
| 3,020 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 7.7448163e-05 |
| 4,712 | Tools for Datalog Boundedness | 1991 | PODS | 6.4568103e-05 |
| 6,429 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.7884926e-05 |
| 8,275 | The Complexity of Why-Provenance for Datalog Queries | 2024 | PODS | 5.3641687e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,365 | Size Bound-Adorned Datalog | 2026 | PODS |
| 2 | 11,082 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS |
| 3 | 6,531 | Query Evaluation by Circuits | 2022 | PODS |
| 4 | 4,712 | Tools for Datalog Boundedness | 1991 | PODS |
| 5 | 6,741 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 6 | 6,370 | On Datalog vs. Polynomial Time | 1991 | PODS |
| 7 | 2,630 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS |
| 8 | 11,495 | Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs | 2024 | PODS |
| 9 | 6,429 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS |
| 10 | 8,073 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS |