Weighted Hypertree Decompositions and Optimal Query Plans
Summary: Weighted hypertree decompositions: hypertree decompositions annotated with cost functions to combine structural and quantitative information (cardinalities/selectivities); minimal-weight decompositions are generally intractable but become polynomial-time (and sometimes parallel) under mild cost/target-tree restrictions. Use a query-cost function to derive optimal logical query plans and show experiments where this hybrid optimizer outperforms a commercial DBMS on large multi-join queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
| 2,057 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 9.665853e-05 |
| 2,835 | Computing Cores for Data Exchange: New Algorithms and Practical Solutions | 2005 | PODS | 8.0468415e-05 |
| 5,840 | Topology Dependent Bounds For FAQs | 2019 | PODS | 5.3062554e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 297 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS | 0.00028572729 |
| 325 | The History of Histograms (abridged) | 2003 | VLDB | 0.00027398081 |
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
| 4,978 | Constraint Satisfaction and Database Theory: a Tutorial | 2000 | PODS | 5.7833452e-05 |
| 5,561 | On the Complexity of Join Predicates | 2001 | PODS | 5.4346872e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
| 7,464 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 4.7186999e-05 |
| 6,946 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS | 4.8874695e-05 |
| 7,500 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7135369e-05 |
| 9,739 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2895392e-05 |
| 10,493 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1905499e-05 |
| 2,804 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1039107e-05 |
| 11,135 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1905499e-05 |
| 10,372 | Soft and Constrained Hypertree Width | 2025 | PODS | 4.1905499e-05 |
| 1,322 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012595941 |