DBScholar

Back to papers

Query Simplification: Graceful Degradation for Join-Order Optimization

Summary: New approach to join-order optimization: when exact planning is intractable on large queries, simplify the join graph within a time budget. Safe-first, then riskier simplifications enable optimal results, with a directing strategy and graceful degradation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4197
Venue
SIGMOD
Year
2009
Pagerank
7.1051056e-05
Overall Rank
3,813 | 73.85%
DOI
10.1145/1559845.1559889

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{neumann_sigmod09,
        title = {{Query Simplification: Graceful Degradation for Join-Order Optimization}},
        author = {Neumann, Thomas},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559889},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559889},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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