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 (Stanford University)
- 2. Christopher Ré (Stanford University)
BibTeX Citation
@inproceedings{tu_sigmod15,
title = {{DunceCap: Query Plans Using Generalized Hypertree Decompositions}},
author = {Tu, Susan and Ré, Christopher},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2764946},
url = {https://dl.acm.org/doi/10.1145/2723372.2764946},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 208 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00024899872 |
| 1,570 | AJAR: Aggregations and Joins over Annotated Relations | 2016 | PODS | 0.0001020376 |
| 5,602 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 6.0678238e-05 |
| 6,268 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS | 5.8281193e-05 |
| 7,535 | Fast Local Subgraph Counting | 2024 | VLDB | 5.4983904e-05 |
| 7,922 | Avoiding Materialisation for Guarded Aggregate Queries | 2025 | VLDB | 5.4250308e-05 |
| 8,098 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 5.3917406e-05 |
| 8,501 | SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries | 2020 | SIGMOD | 5.3285575e-05 |
| 9,527 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 5.1666108e-05 |
| 11,194 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 4.9769913e-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 |
|---|---|---|---|---|
| 402 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00019095982 |
| 684 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00014791388 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 883 | Dynamic Programming Strikes Back | 2008 | SIGMOD |
| 2 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 3 | 12,208 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD |
| 4 | 1,813 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS |
| 5 | 10,778 | One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans | 2026 | VLDB |
| 6 | 138 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD |
| 7 | 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 8 | 7,351 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB |
| 9 | 10,519 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 10 | 8,314 | DunceCap: Compiling Worst-Case Optimal Query Plans | 2015 | SIGMOD |