Database Paper Browser

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
6933
Venue
SIGMOD
Year
2024
Pagerank
4.3027391e-05
Overall Rank
9,693 | 32.57%
DOI
10.1145/3654973

Incoming Non-self Citations Over Time

Authors

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
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059038975
115 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00046221215
182 LEO - DB2's LEarning Optimizer 2001 VLDB 0.00036962631
204 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00034784455
333 Neo: A Learned Query Optimizer 2019 VLDB 0.00027206884
608 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00019235898
640 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00018759152
684 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00018179769
806 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.00016434274
1,236 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00013117798
1,241 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00013097578
1,272 Proactive Re-Optimization 2005 SIGMOD 0.00012920076
1,737 QuickSel: Quick Selectivity Learning with Mixture Models 2020 SIGMOD 0.00010720294
1,758 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00010655546
1,986 AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions 2003 VLDB 9.8536784e-05
2,180 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.3481968e-05
2,212 Skew in Parallel Query Processing 2014 PODS 9.2771827e-05
2,219 SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning 2019 SIGMOD 9.2623533e-05
2,631 Plan Bouquets: Query Processing without Selectivity Estimation 2014 SIGMOD 8.4101843e-05
4,261 Parallelizing Query Optimization 2008 VLDB 6.31244e-05
4,348 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 6.2660237e-05
5,423 Kepler: Robust Learning for Faster Parametric Query Optimization 2023 SIGMOD 5.5130233e-05
5,530 Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling 2021 VLDB 5.4554282e-05
6,337 Parallelizing Extensible Query Optimizers 2009 SIGMOD 5.1053757e-05
6,618 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB 4.9925655e-05
7,854 dbET: Execution Time Distribution-based Plan Selection 2023 SIGMOD 4.6350172e-05
9,305 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 4.3577129e-05
Previous Page 1 / 1 Next

Semantically Similar Papers