Plan Bouquets: Query Processing without Selectivity Estimation
Summary: Plan Bouquets replace selectivity estimation with a compact bouquet covering the error space. Runtime discerns selectivities via bouquet runs, with bounded overhead and guaranteed worst-case performance; compatible with existing optimizers. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 339 | Optimization of Dynamic Query Evaluation Plans | 1994 | SIGMOD | 0.00026851113 |
| 1,547 | Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions | 2011 | VLDB | 0.00011442359 |
| 5,340 | Efficiently Approximating Query Optimizer Plan Diagrams | 2008 | VLDB | 5.5623066e-05 |
| 13,728 | PLASTIC: Reducing Query Optimization Overheads through Plan Recycling | 2003 | SIGMOD | - |
| 4,348 | Identifying Robust Plans through Plan Diagram Reduction | 2008 | VLDB | 6.2660237e-05 |
| 1,070 | Analyzing Plan Diagrams of Database Query Optimizers | 2005 | VLDB | 0.00014316791 |
| 1,962 | Plan Selection based on Query Clustering | 2002 | VLDB | 9.950467e-05 |
| 6,618 | QUEST: An Exploratory Approach to Robust Query Processing | 2014 | VLDB | 4.9925655e-05 |
| 6,561 | On the Stability of Plan Costs and the Costs of Plan Stability | 2010 | VLDB | 5.0099895e-05 |
| 8,639 | A Concave Path to Low-overhead Robust Query Processing | 2018 | VLDB | 4.4793681e-05 |