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
12408
Venue
VLDB
Year
2020
Pagerank
5.5360082e-05
Overall Rank
7,829 | 46.29%
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
5,529 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.18591e-05
8,305 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 5.4568571e-05
8,410 Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems 2022 VLDB 5.4309397e-05
8,494 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 5.4142129e-05
9,626 Spatial Query Optimization With Learning 2024 VLDB 5.2434488e-05
10,881 Robust Plan Evaluation based on Approximate Probabilistic Machine Learning 2025 VLDB 5.093636e-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.00041071971
84 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035838391
151 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00029161879
290 An Overview of Query Optimization in Relational Systems 1998 PODS 0.0002227038
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
465 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001803934
492 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.0001756877
694 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.00014911698
697 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00014888851
829 Proactive Re-Optimization 2005 SIGMOD 0.00013769838
894 Froid: Optimization of Imperative Programs in a Relational Database 2018 VLDB 0.00013367658
1,104 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00012157634
1,256 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00011457194
1,516 Cardinality Estimation: An Experimental Survey 2018 VLDB 0.00010520885
1,573 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 0.00010328171
1,795 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.738718e-05
2,157 A Black-Box Approach to Query Cardinality Estimation 2007 CIDR 9.0625592e-05
2,203 Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models 2017 VLDB 8.9610447e-05
2,944 Query Optimizers: Time to Rethink the Contract? 2009 SIGMOD 7.9335187e-05
3,051 Towards a Hands-Free Query Optimizer through Deep Learning 2019 CIDR 7.8121919e-05
3,482 Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads 2013 VLDB 7.3751635e-05
3,506 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.3581509e-05
4,616 On the Production of Anorexic Plan Diagrams 2007 VLDB 6.6048588e-05
5,281 Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees 2017 SIGMOD 6.2842378e-05
5,537 Uncertainty Aware Query Execution Time Prediction 2014 VLDB 6.1820087e-05
6,019 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 6.0060149e-05
8,004 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.5082745e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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