Circuit Treewidth, Sentential Decision, and Query Compilation
Summary: Bounded circuit treewidth iff bounded SDD width, giving a tight analogue of the circuit-pathwidth/OBDD-width correspondence. Implications for query compilation: SDD-based compilability (constant-width linear-size and polynomial-size SDDs) refines tractability of UCQ lineages with/without inequalities. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Simone Bova
- 2. Stefan Szeider
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,149 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8173876e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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 |
| 571 | The Complexity of Query Reliability | 1998 | PODS | 0.00019910719 |
| 1,268 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012931993 |
| 6,997 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8676446e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,343 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 4.1945683e-05 |
| 12,031 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1945683e-05 |
| 4,706 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB | 5.9820914e-05 |
| 7,149 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8173876e-05 |
| 13,755 | Knowledge compilation = Query rewriting + View synthesis | 2002 | PODS | - |
| 8,410 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS | 4.5204725e-05 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |
| 6,997 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8676446e-05 |
| 7,017 | Query Evaluation by Circuits | 2022 | PODS | 4.8603097e-05 |
| 10,905 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 4.1945683e-05 |