Tight Bounds of Circuits for Sum-Product Queries
Summary: Bounds tight on circuits for a Boolean CQ's provenance over semirings; tropical case: log|F| ≥ (1−ε)·da-entw with an idempotent construction. Uses provenance polynomials, tree-decompositions, and Datalog; extends to formulas and non-Boolean CQs. (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. Hangdong Zhao
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,987 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 4.1905499e-05 |
| 10,355 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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 |
| 3,782 | Bag Query Containment and Information Theory | 2020 | PODS | 6.7691169e-05 |
| 4,787 | The Relational Data Borg is Learning | 2020 | VLDB | 5.9168117e-05 |
| 6,732 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS | 4.9435849e-05 |
| 7,017 | Query Evaluation by Circuits | 2022 | PODS | 4.8556471e-05 |
| 8,029 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS | 4.598451e-05 |
| 8,753 | An Intermediate Representation for Hybrid Database and Machine Learning Workloads | 2021 | VLDB | 4.4520434e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2680295e-05 |
| 12,039 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1905499e-05 |
| 3,005 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7315492e-05 |
| 5,752 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS | 5.3393414e-05 |
| 6,996 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8629707e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 5,647 | Circuit Treewidth, Sentential Decision, and Query Compilation | 2017 | PODS | 5.3913624e-05 |
| 10,356 | Circuits and Formulas for Datalog over Semirings | 2025 | PODS | 4.1905499e-05 |
| 7,017 | Query Evaluation by Circuits | 2022 | PODS | 4.8556471e-05 |
| 10,355 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 4.1905499e-05 |