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
- 2. Paraschos Koutris
- 3. Sudeepa Roy
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 |
|---|---|---|---|---|
| 31 | Provenance Semirings | 2007 | PODS | 0.0007857786 |
| 274 | Regular Path Queries with Constraints | 1997 | PODS | 0.00029390022 |
| 1,185 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013445831 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 2,206 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.2910236e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 2,907 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.933806e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 8,125 | The Complexity of Why-Provenance for Datalog Queries | 2024 | PODS | 4.5797807e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 31 | Provenance Semirings | 2007 | PODS | 0.0007857786 |
| 10,343 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 4.1945683e-05 |
| 7,017 | Query Evaluation by Circuits | 2022 | PODS | 4.8603097e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 6,031 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2415551e-05 |
| 2,907 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.933806e-05 |
| 10,929 | Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs | 2024 | PODS | 4.1945683e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 10,905 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 4.1945683e-05 |