DBScholar

Back to papers

Robust Query Processing: Mission Possible

Summary: Tutorial on robust query processing with strong performance guarantees. Surveys cross-layer architectural and algorithmic advances; contrasts strengths/limitations and lists open problems. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h6d38e2932a0b29e9
Venue
VLDB
Year
2020
Pagerank
5.4190023e-05
Overall Rank
7,954 | 46.53%
DOI
10.14778/3415478.3415561

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{haritsa_vldb20,
        title = {{Robust Query Processing: Mission Possible}},
        author = {Haritsa, Jayant R.},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {12},
        pages = {3425--3428},
        doi = {10.14778/3415478.3415561},
        url = {https://doi.org/10.14778/3415478.3415561},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
4,950 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3421691e-05
7,410 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 5.5342768e-05
8,389 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 5.3413016e-05
8,563 Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems 2022 VLDB 5.3138647e-05
8,879 Spatial Query Optimization With Learning 2024 VLDB 5.2568354e-05
11,283 Robust Plan Evaluation based on Approximate Probabilistic Machine Learning 2025 VLDB 4.9793485e-05
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
53 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00040860054
85 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035864347
149 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00028981723
272 An Overview of Query Optimization in Relational Systems 1998 PODS 0.00022509573
386 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019444411
461 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.00017829982
481 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.00017603972
688 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.00014753664
692 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00014741011
836 Proactive Re-Optimization 2005 SIGMOD 0.00013557047
896 Froid: Optimization of Imperative Programs in a Relational Database 2018 VLDB 0.00013209291
1,122 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.0001193884
1,257 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00011310561
1,536 Cardinality Estimation: An Experimental Survey 2018 VLDB 0.00010327422
1,580 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 0.00010180835
1,821 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.5687882e-05
2,172 A Black-Box Approach to Query Cardinality Estimation 2007 CIDR 8.9214171e-05
2,216 Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models 2017 VLDB 8.8177753e-05
2,891 Query Optimizers: Time to Rethink the Contract? 2009 SIGMOD 7.9021718e-05
3,060 Towards a Hands-Free Query Optimizer through Deep Learning 2019 CIDR 7.6928239e-05
3,519 Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads 2013 VLDB 7.2389387e-05
3,527 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.2310714e-05
4,657 On the Production of Anorexic Plan Diagrams 2007 VLDB 6.4824233e-05
5,078 Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees 2017 SIGMOD 6.2857912e-05
5,656 Uncertainty Aware Query Execution Time Prediction 2014 VLDB 6.0488629e-05
6,113 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 5.8823242e-05
8,159 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.3873068e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 6,198 Adaptive Query Processing: Why, How, When, What Next 2006 SIGMOD
2 8,159 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB
3 7,918 Cache-Oblivious Query Processing 2007 CIDR
4 481 Robust Query Processing through Progressive Optimization 2004 SIGMOD
5 2,600 Robust Query Processing in Co-Processor-accelerated Databases 2016 SIGMOD
6 6,393 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB
7 6,485 Modern Techniques for Querying Graph-Structured Relations: Foundations, System Implementations, and Open Challenges 2022 VLDB
8 569 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD
9 6,113 Robustness Metrics for Relational Query Execution Plans 2018 VLDB
10 12,777 Visualizing the robustness of query execution 2009 CIDR