Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
Summary: Natural tractability criterion: #UCQ(C) is FPT iff the combined CQ(s) of C and their contracts have bounded treewidth. Closure on C needed; even for a single UCQ, meta-decision NP-hard; exponential-time algorithm optimal; WL-dimension of a UCQ NP-hard. (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. Jacob Focke (CISPA Helmholtz Center for Information Security)
- 2. Leslie Ann Goldberg (University of Oxford)
- 3. Marc Roth (Queen Mary University of London; University of Oxford)
- 4. Stanislav Živný (University of Oxford)
BibTeX Citation
@inproceedings{focke_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity}},
url = {https://dl.acm.org/doi/10.1145/3651614},
doi = {10.1145/3651614},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav},
year = {2024}
}
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 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 382 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00019546431 |
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 2,448 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 8.5693075e-05 |
| 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 8.1352657e-05 |
| 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 6.7936492e-05 |
| 6,278 | Constraint Satisfaction and Database Theory: a Tutorial | 2000 | PODS | 5.9287393e-05 |
| 9,036 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS | 5.3272169e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,363 | Extremal Fitting Problems for Conjunctive Queries | 2023 | PODS |
| 2 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 7,028 | Semantic Acyclicity on Graph Databases | 2013 | PODS |
| 4 | 3,801 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 5 | 7,851 | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries | 2021 | PODS |
| 6 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 7 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 8 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 9 | 2,448 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS |
| 10 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |