DBScholar

Back to papers

Coresets for Robust Query Optimization

Summary: Introduces plan coresets for robust query optimization under cardinality uncertainty, proving size bounds across cost classes. Workload-aware construction algorithms yield compact coresets with near-optimal performance despite worst-case lower bounds. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h0497eab77ec94341
Venue
PODS
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,380 | 30.24%
DOI
10.1145/3801896
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{raychaudhury_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Coresets for Robust Query Optimization}},
        url = {https://dl.acm.org/doi/10.1145/3801896},
        doi = {10.1145/3801896},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Raychaudhury, Rahul and Xiu, Haibo and Agarwal, Pankaj K. and Sintos, Stavros and Yang, Jun},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 31 of 31 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0023943337
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019095982
406 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00019050182
569 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00016244162
837 Proactive Re-Optimization 2005 SIGMOD 0.00013551072
1,122 Least Expected Cost Query Optimization: An Exercise in Utility 1999 PODS 0.00011933634
1,298 Parametric Query Optimization for Linear and Piecewise Linear Cost Functions 2002 VLDB 0.00011122244
1,788 Plan Selection based on Query Clustering 2002 VLDB 9.6275306e-05
1,989 Plan Bouquets: Query Processing without Selectivity Estimation 2014 SIGMOD 9.2469024e-05
2,485 Processing a Large Number of Continuous Preference Top-k Queries 2012 SIGMOD 8.3954142e-05
2,583 Fauce: Fast and Accurate Deep Ensembles with Uncertainty for Cardinality Estimation 2021 VLDB 8.2589842e-05
3,140 Solving the Join Ordering Problem via Mixed Integer Linear Programming 2017 SIGMOD 7.6012971e-05
3,396 Variance Aware Optimization of Parameterized Queries 2010 SIGMOD 7.3386533e-05
3,527 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.2283486e-05
3,568 On the Complexity of Approximate Query Optimization 2002 PODS 7.1978817e-05
4,191 Kepler: Robust Learning for Faster Parametric Query Optimization 2023 SIGMOD 6.7425275e-05
4,659 On the Production of Anorexic Plan Diagrams 2007 VLDB 6.4794607e-05
5,042 Leveraging Query Logs and Machine Learning for Parametric Query Optimization 2022 VLDB 6.2995365e-05
5,081 Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees 2017 SIGMOD 6.2830143e-05
5,658 Uncertainty Aware Query Execution Time Prediction 2014 VLDB 6.0460211e-05
5,974 Understanding Cardinality Estimation using Entropy Maximization 2010 PODS 5.9279222e-05
5,988 On the Stability of Plan Costs and the Costs of Plan Stability 2010 VLDB 5.9229752e-05
6,114 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 5.8796178e-05
6,796 dbET: Execution Time Distribution-based Plan Selection 2023 SIGMOD 5.6784895e-05
7,603 On the Calculation of Optimality Ranges for Relational Query Execution Plans 2018 SIGMOD 5.4846849e-05
7,784 Efficient Indexes for Diverse Top-k Range Queries 2020 PODS 5.4520677e-05
8,165 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.3847569e-05
8,393 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 5.3387995e-05
8,659 Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation 2026 VLDB 5.292093e-05
9,735 PAR2QO: Parametric Penalty-Aware Robust Query Optimization 2025 VLDB 5.1325223e-05
11,405 Hint-QPT: Hints for Robust Query Performance Tuning 2025 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,686 Cost-based or Learning-based? A Hybrid Query Optimizer for Query Plan Selection 2022 VLDB
2 682 Robust Estimation of Resource Consumption for SQL Queries using Statistical Techniques 2012 VLDB
3 5,658 Uncertainty Aware Query Execution Time Prediction 2014 VLDB
4 386 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB
5 2,654 A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries 2001 SIGMOD
6 7,603 On the Calculation of Optimality Ranges for Relational Query Execution Plans 2018 SIGMOD
7 5,200 Exact Cardinality Query Optimization with Bounded Execution Cost 2019 SIGMOD
8 11,291 Robust Plan Evaluation based on Approximate Probabilistic Machine Learning 2025 VLDB
9 6,114 Robustness Metrics for Relational Query Execution Plans 2018 VLDB
10 569 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD