DBScholar

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
4833
Venue
SIGMOD
Year
2014
Pagerank
9.3517129e-05
Overall Rank
1,987 | 86.37%
DOI
10.1145/2558555.2558566

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{dutt_sigmod14,
        title = {{Plan Bouquets: Query Processing without Selectivity Estimation}},
        author = {Dutt, Anshuman and Haritsa, Jayant R.},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2558555.2558566},
        url = {https://dl.acm.org/doi/10.1145/2558555.2558566},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 24 of 24 citing papers.

Rank Citing Paper Year Venue Pagerank
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
694 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.00014911698
1,256 Sampling-Based Query Re-Optimization 2016 SIGMOD 0.00011457194
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,000 Permutable Compiled Queries: Dynamically Adapting Compiled Queries without Recompiling 2021 VLDB 6.4069917e-05
5,137 Exact Cardinality Query Optimization with Bounded Execution Cost 2019 SIGMOD 6.3507372e-05
5,552 Enabling Incremental Query Re-Optimization 2016 SIGMOD 6.1778488e-05
6,019 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 6.0060149e-05
6,316 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB 5.9151861e-05
6,349 Grizzly: Efficient Stream Processing Through Adaptive Query Compilation 2020 SIGMOD 5.9049304e-05
6,543 Speeding Up End-to-end Query Execution via Learning-based Progressive Cardinality Estimation 2023 SIGMOD 5.8461929e-05
7,366 Non-Invasive Progressive Optimization for In-Memory Databases 2016 VLDB 5.6322753e-05
8,004 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB 5.5082745e-05
8,211 MONSOON: Multi-Step Optimization and Execution of Queries with Partially Obscured Predicates 2020 SIGMOD 5.4658735e-05
8,305 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 5.4568571e-05
8,494 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 5.4142129e-05
8,636 Adaptive Code Generation for Data-Intensive Analytics 2021 VLDB 5.3954959e-05
9,796 ROME: Robust Query Optimization via Parallel Multi-Plan Execution 2024 SIGMOD 5.21848e-05
10,081 Rethink Query Optimization in HTAP Databases 2023 SIGMOD 5.158939e-05
10,151 Coresets for Robust Query Optimization 2026 PODS 5.093636e-05
10,492 Reqo: A Comprehensive Learning-Based Cost Model for Robust and Explainable Query Optimization 2026 SIGMOD 5.093636e-05
10,986 PAR2QO: Parametric Penalty-Aware Robust Query Optimization 2025 VLDB 5.093636e-05
13,591 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.

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0024089429
53 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00041071971
89 On the Propagation of Errors in the Size of Join Results 1991 SIGMOD 0.00035031529
100 LEO - DB2's LEarning Optimizer 2001 VLDB 0.00034385207
151 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00029161879
289 Optimization of Dynamic Query Evaluation Plans 1994 SIGMOD 0.00022278876
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
448 Self-tuning Histograms: Building Histograms Without Looking at Data 1999 SIGMOD 0.00018292618
492 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.0001756877
566 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00016436005
829 Proactive Re-Optimization 2005 SIGMOD 0.00013769838
1,795 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.738718e-05
3,506 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 7.3581509e-05
3,513 Variance Aware Optimization of Parameterized Queries 2010 SIGMOD 7.354613e-05
4,616 On the Production of Anorexic Plan Diagrams 2007 VLDB 6.6048588e-05
5,365 A Pay-As-You-Go Framework for Query Execution Feedback 2008 VLDB 6.2462467e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 289 Optimization of Dynamic Query Evaluation Plans 1994 SIGMOD
2 1,071 Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions 2011 VLDB
3 4,817 Efficiently Approximating Query Optimizer Plan Diagrams 2008 VLDB
4 13,929 PLASTIC: Reducing Query Optimization Overheads through Plan Recycling 2003 SIGMOD
5 3,506 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB
6 984 Analyzing Plan Diagrams of Database Query Optimizers 2005 VLDB
7 1,771 Plan Selection based on Query Clustering 2002 VLDB
8 6,316 QUEST: An Exploratory Approach to Robust Query Processing 2014 VLDB
9 5,898 On the Stability of Plan Costs and the Costs of Plan Stability 2010 VLDB
10 8,004 A Concave Path to Low-overhead Robust Query Processing 2018 VLDB