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.3985544e-05
Overall Rank
7,975 | 46.55%
DOI
10.14778/3415478.3415561
PDF
Download (CC BY-NC-ND 4.0)

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.

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.00040739114
84 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035920657
149 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00028910892
259 An Overview of Query Optimization in Relational Systems 1998 PODS 0.00022881075
381 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019497061
453 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001801482
471 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.00017691682
689 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.00014725904
690 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00014703258
838 Proactive Re-Optimization 2005 SIGMOD 0.00013528646
896 Froid: Optimization of Imperative Programs in a Relational Database 2018 VLDB 0.00013164545
1,124 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00011898749
1,261 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00011289724
1,534 Cardinality Estimation: An Experimental Survey 2018 VLDB 0.00010309919
1,583 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 0.00010148362
1,831 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.5366955e-05
2,174 A Black-Box Approach to Query Cardinality Estimation 2007 CIDR 8.9067128e-05
2,228 Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models 2017 VLDB 8.7912743e-05
2,888 Query Optimizers: Time to Rethink the Contract? 2009 SIGMOD 7.8895201e-05
3,062 Towards a Hands-Free Query Optimizer through Deep Learning 2019 CIDR 7.6809918e-05
3,384 Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads 2013 VLDB 7.3392425e-05
3,531 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.2065332e-05
4,674 On the Production of Anorexic Plan Diagrams 2007 VLDB 6.4584193e-05
5,101 Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees 2017 SIGMOD 6.2623728e-05
5,670 Uncertainty Aware Query Execution Time Prediction 2014 VLDB 6.0266818e-05
6,128 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 5.860258e-05
8,182 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.3669522e-05
Previous Page 1 / 1 Next

Semantically Similar Papers