DBScholar

Back to papers

Robust Plan Evaluation based on Approximate Probabilistic Machine Learning

Summary: Roq formalizes robustness in query optimization as risk-aware plan performance under uncertain cardinalities and invalid assumptions. Approximate probabilistic ML jointly predicts execution costs and risks, enabling robust plan evaluation and selection beyond conventional point-estimate optimizers. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h046da1509210b1ce
Venue
VLDB
Year
2025
Pagerank
4.9769913e-05
Overall Rank
11,291 | 24.12%
DOI
10.14778/3742728.3742753
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{kamali_vldb25,
        title = {{Robust Plan Evaluation based on Approximate Probabilistic Machine Learning}},
        author = {Kamali, Amin and Kantere, Verena and Zuzarte, Calisto and Corvinelli, Vincent},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {8},
        pages = {2626--2638},
        doi = {10.14778/3742728.3742753},
        url = {https://doi.org/10.14778/3742728.3742753},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,690 Reqo: A Comprehensive Learning-Based Cost Model for Robust and Explainable Query Optimization 2026 SIGMOD 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 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.00061067652
144 Neo: A Learned Query Optimizer 2019 VLDB 0.00029090793
318 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00021166957
386 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019446558
471 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.00017744392
480 The Making of TPC-DS 2006 VLDB 0.00017615432
569 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00016244162
837 Proactive Re-Optimization 2005 SIGMOD 0.00013551072
1,195 Balsa: Learning a Query Optimizer Without Expert Demonstrations 2022 SIGMOD 0.00011574218
1,515 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 0.00010418766
1,735 Flow-Loss: Learning Cardinality Estimates That Matter 2021 VLDB 9.7566604e-05
1,821 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.5646318e-05
2,209 Lero: A Learning-to-Rank Query Optimizer 2023 VLDB 8.8360101e-05
2,686 Cost-based or Learning-based? A Hybrid Query Optimizer for Query Plan Selection 2022 VLDB 8.1300913e-05
2,833 Cost Models for Big Data Query Processing: Learning, Retrofitting, and Our Findings 2020 SIGMOD 7.9539771e-05
3,479 LOGER: A Learned Optimizer towards Generating Efficient and Robust Query Execution Plans 2023 VLDB 7.2665349e-05
3,593 Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads 2017 VLDB 7.1803217e-05
4,536 One Model to Rule them All: Towards Zero-Shot Learning for Databases 2022 CIDR 6.552998e-05
6,108 Optimization of Conjunctive Predicates for Main Memory Column Stores 2016 VLDB 5.8831615e-05
6,114 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 5.8796178e-05
6,714 Simple Adaptive Query Processing vs. Learned Query Optimizers: Observations and Analysis 2023 VLDB 5.6993812e-05
7,958 Robust Query Processing: Mission Possible 2020 VLDB 5.4164639e-05
8,165 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.3847569e-05
9,640 Small Selectivities Matter: Lifting the Burden of Empty Samples 2021 SIGMOD 5.1448486e-05
Previous Page 1 / 1 Next

Semantically Similar Papers