QUEST: An Exploratory Approach to Robust Query Processing

Summary: QUEST uses plan bouquets and calibrated, cost-limited trial executions to discover predicate selectivities at runtime, delivering robust query processing under cardinality-estimation errors. It provides bounded suboptimality, repeatable behavior, and a PostgreSQL prototype. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11014
Venue: VLDB
Year: 2014
Pagerank: 5.9151861e-05
Overall Rank: 6,316 | 56.67%
DOI: 10.14778/2733004.2733031

Incoming Non-self Citations Over Time

Authors

1. Anshuman Dutt (Indian Institute of Science)
2. Sumit Neelam (Indian Institute of Science)
3. Jayant R. Haritsa (Indian Institute of Science)

BibTeX Citation

@article{dutt_vldb14,
        title = {{QUEST: An Exploratory Approach to Robust Query Processing}},
        author = {Dutt, Anshuman and Neelam, Sumit and Haritsa, Jayant R.},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {13},
        pages = {1585--1588},
        doi = {10.14778/2733004.2733031},
        url = {https://doi.org/10.14778/2733004.2733031},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,712	SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning	2019	SIGMOD	9.9492299e-05
1,815	SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning	2018	VLDB	9.6894541e-05
5,137	Exact Cardinality Query Optimization with Bounded Execution Cost	2019	SIGMOD	6.3507372e-05
8,305	PARQO: Penalty-Aware Robust Plan Selection in Query Optimization	2024	VLDB	5.4568571e-05
9,796	ROME: Robust Query Optimization via Parallel Multi-Plan Execution	2024	SIGMOD	5.21848e-05
10,986	PAR2QO: Parametric Penalty-Aware Robust Query Optimization	2025	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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,987	Plan Bouquets: Query Processing without Selectivity Estimation	2014	SIGMOD	9.3517129e-05
4,616	On the Production of Anorexic Plan Diagrams	2007	VLDB	6.6048588e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,035	Hint-QPT: Hints for Robust Query Performance Tuning	2025	VLDB
2	492	Robust Query Processing through Progressive Optimization	2004	SIGMOD
3	3,506	Identifying Robust Plans through Plan Diagram Reduction	2008	VLDB
4	566	Towards a Robust Query Optimizer: A Principled and Practical Approach	2005	SIGMOD
5	12,486	Visualizing the robustness of query execution	2009	CIDR
6	7,829	Robust Query Processing: Mission Possible	2020	VLDB
7	5,898	On the Stability of Plan Costs and the Costs of Plan Stability	2010	VLDB
8	6,019	Robustness Metrics for Relational Query Execution Plans	2018	VLDB
9	8,004	A Concave Path to Low-overhead Robust Query Processing	2018	VLDB
10	1,987	Plan Bouquets: Query Processing without Selectivity Estimation	2014	SIGMOD