DBScholar

Back to papers

DunceCap: Compiling Worst-Case Optimal Query Plans

Summary: DunceCap is a query compiler that combines Yannakakis' acyclic-join algorithm with a universal worst-case optimal planner to produce end-to-end optimal plans. It yields order-of-magnitude gains over standard RDBMS and simple WCO baselines on diverse multiway-join workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5155
Venue
SIGMOD
Year
2015
Pagerank
5.4743814e-05
Overall Rank
8,168 | 43.97%
DOI
10.1145/2723372.2764945

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{perelman_sigmod15,
        title = {{DunceCap: Compiling Worst-Case Optimal Query Plans}},
        author = {Perelman, Adam 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.2764945},
        url = {https://dl.acm.org/doi/10.1145/2723372.2764945},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
411 Worst-case Optimal Join Algorithms 2012 PODS 0.00018902089
Previous Page 1 / 1 Next

Semantically Similar Papers