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
6934
Venue
SIGMOD
Year
2024
Pagerank
4.2986161e-05
Overall Rank
9,692 | 32.65%
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.00059446482
116 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00046191288
181 LEO - DB2's LEarning Optimizer 2001 VLDB 0.00036970794
203 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00034868567
329 Neo: A Learned Query Optimizer 2019 VLDB 0.00027301488
606 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00019251186
634 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00018844568
680 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00018193263
804 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001643674
1,234 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00013115865
1,240 Multi-dimensional Selectivity Estimation Using Compressed Histogram Information 1999 SIGMOD 0.00013090678
1,268 Proactive Re-Optimization 2005 SIGMOD 0.00012914584
1,727 QuickSel: Quick Selectivity Learning with Mixture Models 2020 SIGMOD 0.00010731889
1,756 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00010659753
1,990 AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions 2003 VLDB 9.8491124e-05
2,187 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.3429142e-05
2,216 Skew in Parallel Query Processing 2014 PODS 9.2693784e-05
2,222 SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning 2019 SIGMOD 9.2598438e-05
2,632 Plan Bouquets: Query Processing without Selectivity Estimation 2014 SIGMOD 8.4153283e-05
4,255 Parallelizing Query Optimization 2008 VLDB 6.3080082e-05
4,342 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 6.2680535e-05
5,412 Kepler: Robust Learning for Faster Parametric Query Optimization 2023 SIGMOD 5.5200608e-05
5,540 Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling 2021 VLDB 5.450319e-05
6,333 Parallelizing Extensible Query Optimizers 2009 SIGMOD 5.1013149e-05
6,616 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB 4.9881716e-05
7,854 dbET: Execution Time Distribution-based Plan Selection 2023 SIGMOD 4.6306186e-05
9,312 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 4.353536e-05
Previous Page 1 / 1 Next

Semantically Similar Papers