Hypertree Decompositions: Questions and Answers
Summary: Defines hypertree decompositions and bounded hypertree width as a principled generalization of query acyclicity, capturing many realistic mildly-cyclic CQs. Shows how decomposition-based algorithms yield tractable evaluation, containment, and CSP complexity results. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob (University of Oxford)
- 2. Gianluigi Greco (University of Calabria)
- 3. Nicola Leone (University of Calabria)
- 4. Francesco Scarcello (University of Calabria)
BibTeX Citation
@inproceedings{gottlob_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Hypertree Decompositions: Questions and Answers}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902309},
doi = {10.1145/2902251.2902309},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg and Greco, Gianluigi and Leone, Nicola and Scarcello, Francesco},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,461 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS |
| 2 | 7,029 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 3 | 7,759 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS |
| 4 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 5 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 6 | 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS |
| 7 | 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |
| 8 | 10,653 | Soft and Constrained Hypertree Width | 2025 | PODS |
| 9 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 10 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |