DBScholar

Back to papers

Optimal Top-Down Join Enumeration

Summary: Top-down join enumeration algorithm optimal for the join graph. Preserves DP-like architecture, uses branch-and-bound, and enables migrating from bottom-up optimizers to top-down search with substantially faster performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3962
Venue
SIGMOD
Year
2007
Pagerank
9.91063e-05
Overall Rank
1,727 | 88.16%
DOI
10.1145/1247480.1247567

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{dehaan_sigmod07,
        title = {{Optimal Top-Down Join Enumeration}},
        author = {DeHaan, David and Tompa, Frank Wm.},
        series = {{SIGMOD} '07},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1247480.1247567},
        url = {https://dl.acm.org/doi/10.1145/1247480.1247567},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers