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
Authors
- 1. Austen Z. Fan (University of Wisconsin)
- 2. Paraschos Koutris (University of Wisconsin)
- 3. Hangdong Zhao (University of Wisconsin)
BibTeX Citation
@inproceedings{fan_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Tight Bounds of Circuits for Sum-Product Queries}},
url = {https://dl.acm.org/doi/10.1145/3651588},
doi = {10.1145/3651588},
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 Zhao, Hangdong},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,135 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 5.093636e-05 |
| 10,159 | Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time | 2026 | PODS | 5.093636e-05 |
| 10,639 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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,927 | In-Database Learning with Sparse Tensors | 2018 | PODS | 7.9531195e-05 |
| 3,457 | Bag Query Containment and Information Theory | 2020 | PODS | 7.3981641e-05 |
| 4,128 | The Relational Data Borg is Learning | 2020 | VLDB | 6.8850804e-05 |
| 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS | 6.064817e-05 |
| 6,398 | Query Evaluation by Circuits | 2022 | PODS | 5.8867918e-05 |
| 8,047 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS | 5.500514e-05 |
| 8,960 | An Intermediate Representation for Hybrid Database and Machine Learning Workloads | 2021 | VLDB | 5.3444589e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,994 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 2 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 3 | 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS |
| 4 | 5,982 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS |
| 5 | 7,640 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |
| 6 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 7 | 6,713 | Circuit Treewidth, Sentential Decision, and Query Compilation | 2017 | PODS |
| 8 | 10,640 | Circuits and Formulas for Datalog over Semirings | 2025 | PODS |
| 9 | 6,398 | Query Evaluation by Circuits | 2022 | PODS |
| 10 | 10,639 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS |