DunceCap: Query Plans Using Generalized Hypertree Decompositions
Summary: Query plans are cast as generalized hypertree decompositions and scored by minimal fractional hypertree width to bound worst-case join runtimes. Benchmarked on Stanford Large Network Dataset Collection, DunceCap rivals LogicBlox on cyclic queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Susan Tu
- 2. Christopher Ré
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 341 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026850764 |
| 2,173 | AJAR: Aggregations and Joins over Annotated Relations | 2016 | PODS | 9.3767985e-05 |
| 5,076 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.709895e-05 |
| 7,500 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7135369e-05 |
| 7,936 | Fast Local Subgraph Counting | 2024 | VLDB | 4.6089395e-05 |
| 8,423 | SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries | 2020 | SIGMOD | 4.5112315e-05 |
| 9,088 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.3940132e-05 |
| 10,493 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1905499e-05 |
| 10,560 | Avoiding Materialisation for Guarded Aggregate Queries | 2025 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,734 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9553181e-05 |
| 8,065 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5899218e-05 |
| 1,344 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012477274 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 11,703 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD | 4.1905499e-05 |
| 2,298 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0746479e-05 |
| 212 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033997204 |
| 1,039 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014488271 |
| 7,247 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB | 4.7846107e-05 |
| 8,195 | DunceCap: Compiling Worst-Case Optimal Query Plans | 2015 | SIGMOD | 4.5573236e-05 |