Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability
Summary: Quantified-star-size with hypertree decompositions characterizes tractable counting only for bounded-arity simple CQs; in general it is insufficient. Introduce #-generalized hypertree decompositions yielding FPT preprocessing + polynomial-time counting for bounded #-ghw, and a hybrid method that leverages database constraints (keys/FDs) to expand tractable classes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Gianluigi Greco (University of Calabria)
- 2. Francesco Scarcello (University of Calabria)
BibTeX Citation
@inproceedings{greco_pods14,
address = {New York, NY, USA},
series = {{PODS} '14},
title = {{Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability}},
url = {https://dl.acm.org/doi/10.1145/2594538.2594559},
doi = {10.1145/2594538.2594559},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Greco, Gianluigi and Scarcello, Francesco},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 637 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00015341557 |
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 4,355 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 6.6412791e-05 |
| 11,488 | Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity | 2024 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 684 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00014798237 |
| 1,690 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.8609347e-05 |
| 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 8.0895728e-05 |
| 4,189 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS | 6.7459542e-05 |
| 7,922 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 5.4261252e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,043 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS |
| 2 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 7,794 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |
| 4 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 5 | 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 6 | 2,365 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 7 | 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 8 | 637 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 9 | 11,488 | Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity | 2024 | PODS |
| 10 | 11,832 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |