A Concave Path to Low-overhead Robust Query Processing

Summary: FrugalSpillBound applies concave-down plan-costs to SpillBound, trading robustness for far lower compilation overhead in robust query processing. Relaxing guarantees by 2x yields about 100x overhead reduction; OLAP benchmarks show up to 1000x gains, enabling ad-hoc robust processing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11732
Venue: VLDB
Year: 2018
Pagerank: 4.4750742e-05
Overall Rank: 8,638 | 39.97%
DOI: 10.14778/3275366.3275368

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,130	Robust Query Processing: Mission Possible	2020	VLDB	4.5746794e-05
8,440	PARQO: Penalty-Aware Robust Plan Selection in Query Optimization	2024	VLDB	4.505741e-05
8,623	Adaptive Code Generation for Data-Intensive Analytics	2021	VLDB	4.4786182e-05
10,635	Robust Plan Evaluation based on Approximate Probabilistic Machine Learning	2025	VLDB	4.1905499e-05
10,757	PAR2QO: Parametric Penalty-Aware Robust Query Optimization	2025	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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.0040465394
71	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059446482
650	Robust Query Processing through Progressive Optimization	2004	SIGMOD	0.0001865144
1,077	What happens during a Join? Dissecting CPU and Memory Optimization Effects	2000	VLDB	0.00014224986
1,268	Proactive Re-Optimization	2005	SIGMOD	0.00012914584
1,644	Parametric Query Optimization for Linear and Piecewise Linear Cost Functions	2002	VLDB	0.0001102889
1,990	AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions	2003	VLDB	9.8491124e-05
2,632	Plan Bouquets: Query Processing without Selectivity Estimation	2014	SIGMOD	8.4153283e-05
4,342	Identifying Robust Plans through Plan Diagram Reduction	2008	VLDB	6.2680535e-05
6,372	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB	5.0878306e-05
6,471	Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees	2017	SIGMOD	5.0438582e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,774	Optimizing Disjunctive Queries with Expensive Predicates	1994	SIGMOD	0.0001059836
7,462	Non-Invasive Progressive Optimization for In-Memory Databases	2016	VLDB	4.7189301e-05
9,692	ROME: Robust Query Optimization via Parallel Multi-Plan Execution	2024	SIGMOD	4.2986161e-05
6,372	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB	5.0878306e-05
650	Robust Query Processing through Progressive Optimization	2004	SIGMOD	0.0001865144
6,561	On the Stability of Plan Costs and the Costs of Plan Stability	2010	VLDB	5.0055336e-05
6,763	Robustness Metrics for Relational Query Execution Plans	2018	VLDB	4.9291549e-05
4,342	Identifying Robust Plans through Plan Diagram Reduction	2008	VLDB	6.2680535e-05
6,616	QUEST: An Exploratory Approach to Robust Query Processing	2014	VLDB	4.9881716e-05
2,632	Plan Bouquets: Query Processing without Selectivity Estimation	2014	SIGMOD	8.4153283e-05