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 |
|---|---|---|---|---|
| 342 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026795977 |
| 2,169 | AJAR: Aggregations and Joins over Annotated Relations | 2016 | PODS | 9.3845975e-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 |
| 7,934 | Fast Local Subgraph Counting | 2024 | VLDB | 4.613363e-05 |
| 8,432 | SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries | 2020 | SIGMOD | 4.5153924e-05 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |
| 10,483 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.1945683e-05 |
| 10,551 | Avoiding Materialisation for Guarded Aggregate Queries | 2025 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,738 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9600502e-05 |
| 8,061 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5943269e-05 |
| 1,341 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012486285 |
| 2,275 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.1262202e-05 |
| 11,698 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD | 4.1945683e-05 |
| 2,296 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0776226e-05 |
| 211 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033981214 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 7,250 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB | 4.78908e-05 |
| 8,195 | DunceCap: Compiling Worst-Case Optimal Query Plans | 2015 | SIGMOD | 4.561696e-05 |