DBScholar

Back to papers

ROME: Robust Query Optimization via Parallel Multi-Plan Execution

Summary: ROME: non-intrusive robust query processing via parallel multi-plan execution on top of any SQL engine. Select complementary plans to hedge cardinality-estimation errors; first finisher wins. Cost-based greedy/exhaustive plan selection via diversity/probabilistic overhead models. (summarized by gpt-5.4-mini on May 24 2026)

Paper ID
6995
Venue
SIGMOD
Year
2024
Pagerank
5.21848e-05
Overall Rank
9,796 | 32.80%
DOI
10.1145/3654973

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wei_sigmod24,
        title = {{ROME: Robust Query Optimization via Parallel Multi-Plan Execution}},
        author = {Wei, Ziyun and Trummer, Immanuel},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654973},
        url = {https://dl.acm.org/doi/10.1145/3654973},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 cited papers.

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

Rank Cited Paper Year Venue Pagerank
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
53 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00041071971
84 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035838391
100 LEO - DB2's LEarning Optimizer 2001 VLDB 0.00034385207
154 Neo: A Learned Query Optimizer 2019 VLDB 0.00028726181
323 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00021264788
378 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00019638121
465 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001803934
566 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00016436005
829 Proactive Re-Optimization 2005 SIGMOD 0.00013769838
1,053 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00012401532
1,104 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00012157634
1,170 QuickSel: Quick Selectivity Learning with Mixture Models 2020 SIGMOD 0.00011827259
1,256 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00011457194
1,448 Skew in Parallel Query Processing 2014 PODS 0.00010758872
1,645 AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions 2003 VLDB 0.00010129244
1,712 SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning 2019 SIGMOD 9.9492299e-05
1,795 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.738718e-05
1,987 Plan Bouquets: Query Processing without Selectivity Estimation 2014 SIGMOD 9.3517129e-05
3,506 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.3581509e-05
3,726 Parallelizing Query Optimization 2008 VLDB 7.1697834e-05
4,470 Kepler: Robust Learning for Faster Parametric Query Optimization 2023 SIGMOD 6.6817353e-05
5,000 Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling 2021 VLDB 6.4069917e-05
6,026 Parallelizing Extensible Query Optimizers 2009 SIGMOD 6.0024042e-05
6,316 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB 5.9151861e-05
7,193 dbET: Execution Time Distribution-based Plan Selection 2023 SIGMOD 5.6770249e-05
9,446 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 5.2667452e-05
Previous Page 1 / 1 Next

Semantically Similar Papers