Tractable Lineages on Treelike Instances: Limits and Extensions
Summary: MSO probabilistic query evaluation is linear-time only on bounded-treewidth instances; FO already hard on any efficiently constructible unbounded-treewidth graph class. Lineages: MSO on bounded-treewidth yields bounded-treewidth circuits, poly-size OBDDs and linear d‑DNNFs; some UCQs with disequalities force superpolynomial OBDDs on unbounded-treewidth classes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,256 | ProvSQL: Provenance and Probability Management in PostgreSQL | 2018 | VLDB | 9.1879032e-05 |
| 5,638 | Circuit Treewidth, Sentential Decision, and Query Compilation | 2017 | PODS | 5.3965476e-05 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 1,268 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012931993 |
| 3,314 | Computing Query Probability with Incidence Algebras | 2010 | PODS | 7.2318581e-05 |
| 5,296 | Running Tree Automata on Probabilistic XML | 2009 | PODS | 5.5802694e-05 |
| 6,169 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1716068e-05 |
| 6,804 | A Dichotomy for Non-repeating Queries with Negation in Probabilistic Databases | 2014 | PODS | 4.9224361e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,967 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS | 4.1945683e-05 |
| 11,324 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 4.1945683e-05 |
| 7,163 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8132033e-05 |
| 5,638 | Circuit Treewidth, Sentential Decision, and Query Compilation | 2017 | PODS | 5.3965476e-05 |
| 1,970 | Approximate Lineage for Probabilistic Databases | 2008 | VLDB | 9.896375e-05 |
| 7,754 | Lineage Processing over Correlated Probabilistic Databases | 2010 | SIGMOD | 4.6600967e-05 |
| 7,473 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 4.7198203e-05 |
| 8,410 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS | 4.5204725e-05 |
| 9,740 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2936538e-05 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |