Database Paper Browser

Back to papers

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)

Paper ID
4772
Venue
SIGMOD
Year
2014
Pagerank
8.4153283e-05
Overall Rank
2,632 | 81.71%
DOI
10.1145/2558555.2558566

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 23 of 23 citing papers.

Rank Citing Paper Year Venue Pagerank
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059446482
1,104 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.0001398479
1,756 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00010659753
2,154 SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning 2018 VLDB 9.4176683e-05
2,222 SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning 2019 SIGMOD 9.2598438e-05
5,540 Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling 2021 VLDB 5.450319e-05
5,696 Exact Cardinality Query Optimization with Bounded Execution Cost 2019 SIGMOD 5.367449e-05
5,737 Enabling Incremental Query Re-Optimization 2016 SIGMOD 5.3459609e-05
6,616 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB 4.9881716e-05
6,649 Grizzly: Efficient Stream Processing Through Adaptive Query Compilation 2020 SIGMOD 4.9724735e-05
6,763 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 4.9291549e-05
7,220 Speeding Up End-to-end Query Execution via Learning-based Progressive Cardinality Estimation 2023 SIGMOD 4.7926382e-05
7,462 Non-Invasive Progressive Optimization for In-Memory Databases 2016 VLDB 4.7189301e-05
8,162 MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates 2020 SIGMOD 4.5686903e-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
8,638 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 4.4750742e-05
9,191 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 4.3738237e-05
9,692 ROME: Robust Query Optimization via Parallel Multi-Plan Execution 2024 SIGMOD 4.2986161e-05
9,929 Rethink Query Optimization in HTAP Databases 2023 SIGMOD 4.2470891e-05
10,203 Reqo: A Comprehensive Learning-Based Cost Model for Robust and Explainable Query Optimization 2026 SIGMOD 4.1905499e-05
10,757 PAR2QO: Parametric Penalty-Aware Robust Query Optimization 2025 VLDB 4.1905499e-05
13,403 CODD: A Dataless Approach to Big Data Testing 2015 VLDB -
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