Soft and Constrained Hypertree Width
Summary: Proposes soft hypertree width (shw), a relaxation of hypertree width for CQ evaluation via candidate decompositions. Shw never exceeds hw and can be smaller, preserving tractability while enabling constraints and preferences; prototype experiments show practical impact. (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. Matthias Lanzinger
- 2. Cem Okulmus
- 3. Reinhard Pichler
- 4. Alexander Selzer
- 5. Georg Gottlob
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 |
|---|---|---|---|---|
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
| 3,241 | TPC-DS, Taking Decision Support Benchmarking to the Next Level | 2002 | SIGMOD | 7.3305643e-05 |
| 3,511 | Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs | 2022 | VLDB | 7.0254052e-05 |
| 4,465 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB | 6.1604282e-05 |
| 5,077 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.7153846e-05 |
| 7,501 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7180617e-05 |
| 8,486 | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth | 2022 | PODS | 4.4999394e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,744 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS | 5.3441438e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
| 11,324 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 4.1945683e-05 |
| 10,483 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1945683e-05 |
| 11,132 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1945683e-05 |
| 6,949 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS | 4.8898337e-05 |
| 2,796 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1112658e-05 |
| 1,328 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012565612 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |