QUEST: An Exploratory Approach to Robust Query Processing
Summary: QUEST enables exploratory, run-time robust SQL query processing that avoids compile-time selectivity estimates. It formalizes robustness via MSO (maximum performance sub-optimality) and a plan bouquet—a small set of plans whose cost-limited executions reveal true selectivities; MSO ≤ 4·|PlanBouquet|, with empirical PostgreSQL prototype and deployment notes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anshuman Dutt
- 2. Sumit Neelam
- 3. Jayant R. Haritsa
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,156 | SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning | 2018 | VLDB | 9.4170209e-05 |
| 2,219 | SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning | 2019 | SIGMOD | 9.2623533e-05 |
| 5,685 | Exact Cardinality Query Optimization with Bounded Execution Cost | 2019 | SIGMOD | 5.3717535e-05 |
| 8,448 | PARQO: Penalty-Aware Robust Plan Selection in Query Optimization | 2024 | VLDB | 4.5100508e-05 |
| 9,693 | ROME: Robust Query Optimization via Parallel Multi-Plan Execution | 2024 | SIGMOD | 4.3027391e-05 |
| 10,751 | PAR2QO: Parametric Penalty-Aware Robust Query Optimization | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 2,631 | Plan Bouquets: Query Processing without Selectivity Estimation | 2014 | SIGMOD | 8.4101843e-05 |
| 5,466 | On the Production of Anorexic Plan Diagrams | 2007 | VLDB | 5.4909203e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,808 | Hint-QPT: Hints for Robust Query Performance Tuning | 2025 | VLDB | 4.1945683e-05 |
| 650 | Robust Query Processing through Progressive Optimization | 2004 | SIGMOD | 0.00018659177 |
| 4,348 | Identifying Robust Plans through Plan Diagram Reduction | 2008 | VLDB | 6.2660237e-05 |
| 684 | Towards a Robust Query Optimizer: A Principled and Practical Approach | 2005 | SIGMOD | 0.00018179769 |
| 12,291 | Visualizing the robustness of query execution | 2009 | CIDR | 4.1945683e-05 |
| 8,127 | Robust Query Processing: Mission Possible | 2020 | VLDB | 4.579056e-05 |
| 6,561 | On the Stability of Plan Costs and the Costs of Plan Stability | 2010 | VLDB | 5.0099895e-05 |
| 6,763 | Robustness Metrics for Relational Query Execution Plans | 2018 | VLDB | 4.9338479e-05 |
| 8,639 | A Concave Path to Low-overhead Robust Query Processing | 2018 | VLDB | 4.4793681e-05 |
| 2,631 | Plan Bouquets: Query Processing without Selectivity Estimation | 2014 | SIGMOD | 8.4101843e-05 |