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: h87fa625e7d83f360
Venue: SIGMOD
Year: 2024
Pagerank: 5.3231221e-05
Overall Rank: 8,524 | 42.69%
DOI: 10.1145/3654973

Incoming Non-self Citations Over Time

Authors

1. Ziyun Wei (Cornell University)
2. Immanuel Trummer (Cornell University)

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 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,730	PAR2QO: Parametric Penalty-Aware Robust Query Optimization	2025	VLDB	5.1349531e-05
10,741	OBELISK: Efficient Offline Query Planning with Bayesian Optimization-Informed Language Model Reasoning	2026	VLDB	4.9793485e-05
10,928	Real-time SQL Plan Management in Oracle	2026	VLDB	4.9793485e-05
10,941	Ultron: History-Based Query Optimization at Databricks	2026	VLDB	4.9793485e-05

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
15	How Good Are Query Optimizers, Really?	2016	VLDB	0.00061066921
53	Eddies: Continuously Adaptive Query Processing	2000	SIGMOD	0.00040860054
85	Learned Cardinalities: Estimating Correlated Joins with Deep Learning	2019	CIDR	0.00035864347
98	LEO - DB2's LEarning Optimizer	2001	VLDB	0.00034106982
145	Neo: A Learned Query Optimizer	2019	VLDB	0.0002908188
318	DeepDB: Learn from Data, not from Queries!	2020	VLDB	0.00021167555
362	Bao: Making Learned Query Optimization Practical	2021	SIGMOD	0.00019989474
461	An End-to-End Learning-based Cost Estimator	2020	VLDB	0.00017829982
569	Towards a Robust Query Optimizer: A Principled and Practical Approach	2005	SIGMOD	0.00016245271
836	Proactive Re-Optimization	2005	SIGMOD	0.00013557047
1,077	Multi-dimensional Selectivity Estimation Using Compressed Histogram Information	1999	SIGMOD	0.00012154948
1,122	Least Expected Cost Query Optimization: An Exercise in Utility	1999	PODS	0.0001193884
1,156	QuickSel: Quick Selectivity Learning with Mixture Models	2020	SIGMOD	0.00011777105
1,257	Sampling-Based Query Re-Optimization	2016	SIGMOD	0.00011310561
1,481	Skew in Parallel Query Processing	2014	PODS	0.00010539119
1,603	SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning	2019	SIGMOD	0.00010097649
1,612	AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions	2003	VLDB	0.00010072731
1,821	Least Expected Cost Query Optimization: What Can We Expect?	2002	PODS	9.5687882e-05
1,987	Plan Bouquets: Query Processing without Selectivity Estimation	2014	SIGMOD	9.250242e-05
3,527	Identifying Robust Plans through Plan Diagram Reduction	2008	VLDB	7.2310714e-05
3,775	Parallelizing Query Optimization	2008	VLDB	7.0272615e-05
4,202	Kepler: Robust Learning for Faster Parametric Query Optimization	2023	SIGMOD	6.7374091e-05
4,793	Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling	2021	VLDB	6.4127583e-05
6,136	Parallelizing Extensible Query Optimizers	2009	SIGMOD	5.8759799e-05
6,393	QUEST: An Exploratory Approach to Robust Query Processing	2014	VLDB	5.8002013e-05
6,791	dbET: Execution Time Distribution-based Plan Selection	2023	SIGMOD	5.6811782e-05
9,621	Parallelizing Query Optimization on Shared-Nothing Architectures	2016	VLDB	5.1497631e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,159	A Concave Path to Low-overhead Robust Query Processing	2018	VLDB
2	2,136	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB
3	481	Robust Query Processing through Progressive Optimization	2004	SIGMOD
4	682	Robust Estimation of Resource Consumption for SQL Queries using Statistical Techniques	2012	VLDB
5	5,735	Efficient and Accurate Cost Models for Parallel Query Optimization	1996	PODS
6	569	Towards a Robust Query Optimizer: A Principled and Practical Approach	2005	SIGMOD
7	446	Query Optimization for Parallel Execution	1992	SIGMOD
8	10,368	Coresets for Robust Query Optimization	2026	PODS
9	11,283	Robust Plan Evaluation based on Approximate Probabilistic Machine Learning	2025	VLDB
10	6,113	Robustness Metrics for Relational Query Execution Plans	2018	VLDB