Plan bouquets
Authors:
Open Access
- 18 June 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1039-1050
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Preventing bad plans by bounding the impact of cardinality estimation errorsProceedings of the VLDB Endowment, 2009
- A pay-as-you-go framework for query execution feedbackProceedings of the VLDB Endowment, 2008
- Identifying robust plans through plan diagram reductionProceedings of the VLDB Endowment, 2008
- Incremental Medians via Online BiddingAlgorithmica, 2007
- Proactive re-optimization2005
- Robust query processing through progressive optimization2004
- Least expected cost query optimization2002
- Self-tuning histograms1999
- Optimization of dynamic query evaluation plans1994
- Access path selection in a relational database management system1979