Hypertree Decompositions and Tractable Queries
Summary: Shows recognizing bounded query-width is NP-complete (k=4), settling the Chekuri–Rajaraman open problem. Introduces hypertree decompositions and hypertree-width — strictly more general than query-width, polynomially testable, and enabling efficient evaluation of Boolean CQs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob (Institute for Information Systems; Technical University of Vienna)
- 2. Nicola Leone (Institute for Information Systems; Technical University of Vienna)
- 3. Francesco Scarcello (Institute for Informatics, National Research Council of Italy)
BibTeX Citation
@inproceedings{gottlob_pods99,
address = {New York, NY, USA},
series = {{PODS} '99},
title = {{Hypertree Decompositions and Tractable Queries}},
url = {https://dl.acm.org/doi/10.1145/303976.303979},
doi = {10.1145/303976.303979},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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 |
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,759 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS |
| 2 | 6,565 | Tractability Beyond beta-Acyclicity for Conjunctive Queries with Negation | 2021 | PODS |
| 3 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 4 | 10,653 | Soft and Constrained Hypertree Width | 2025 | PODS |
| 5 | 7,029 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 6 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 7 | 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |
| 8 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 9 | 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS |
| 10 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |