[gaku09] Archana Ganapathi, Harumi Kuno, Umeshwar Dayal, Janet Wiener, Armando Fox, Michael Jordan, and David Patterson. Predicting multiple performance metrics for queries: Better decisions enabled by machine learning. In Proc. Int'l Conference on Data Engineering (ICDE'09), 2009. [ bib | .pdf | .pdf ]
[bach05] Brian Babcock and Surajit Chaudhuri. Towards a robust query optimizer: a principled and practical approach. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD'05), pages 119-130, 2005. [ bib | .pdf ]
User specified confidence threshold specifies how likely it should be that the actual cost of the plan is less than or equal to the reported (point) cost estimate. Cardinality estimates for base tables and intermediate query results are based on join synopses, under the restriction that only foreign-key joins are permitted. The cardinality distribution is determined using the join synopsis and Bayes' rule.
[babi05] Shivnath Babu, Pedro Bizarro, and David J. DeWitt. Proactive re-optimization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'05), 2005. [ bib | .pdf ]
Represents uncertainty in operator estimates using intervals, and tries to identify plans that are robust (close to optimal) throughout the interval, or a set of switchable plans that cover the interval. Implements a run-time switch operation, and modifies other operators so that they initially produce a randomized sample of their output.
[mara04] Volker Markl, Vijayshankar Raman, David Simmen, Guy Lohman, Hamid Pirahesh, and Miso Cilimdzic. Robust query processing through progressive optimization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'04), pages 659-670, 2004. [ bib | .pdf ]
Hardcopy on file. Plan reoptimization is triggered by cardinality checking operators inserted into the plan. Checks determine whether the actual cardinality differs from the predicted cardinality by enough that the optimizer would have chosen a different plan. The plan transition cardinalities are determined at optimization time. Reoptimization considers the use of materialized intermediate results when reoptimizing the query.
[ilra03] Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Gao, and Eileen Lin. Estimating compilation time of a query optimizer. In ACM SIGMOD Conference, pages 373-384, 2003. [ bib | .pdf | .pdf ]
Claims average 30% estimation time error with 3% of compilation time overhead to produce the estimate.
[vopa02] Kristofer Vorwerk and G. N. Paulley. On implicate discovery and query optimization. In Proc. International Database Engineering and Applications Symposium (IDEAS'02), pages 2-11, July 2002. [ bib | .pdf ]
[brch02] Nicolas Bruno and Surajit Chaudhuri. Exploiting statistics on query expressions for optimization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'02), 2002. [ bib | .pdf ]
[ghpa02] Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, and Jayant R. Haritsa. Plan selection based on query clustering. In International Conference on Very Large Data Bases (VLDB'22), pages 179-190, 2002. [ bib | .pdf | .pdf ]
Classifies SPJ queries using features such as number of tables in the query, the number of SARGable predicates in the query, and the sizes of the tables. For each class of queries, the system maintains a plan template, which can be instantiated for any query in the class. To process a query, system first tries to match it to an existing class. If it can, the class plan template is instantiated and the resulting plan is used for the query. Otherwise, the query is compiled and used to start a new class.
[stlo01] Michael Stillger, Guy M. Lohman, Volker Markl, and Mokhtar Kandil. LEO - DB2's LEarning Optimizer. In Proceedings of the International Conference on Very Large Data Bases (VLDB), pages 19-28, 2001. [ bib | .pdf | .pdf ]
[koss00] Donald Kossmann. The state of the art in distributed query processing. ACM Computing Surveys, 32(4):422-469, 2000. [ bib | http | .pdf ]
[kade98] Navin Kabra and David J. DeWitt. Efficient mid-query re-optimization of sub-optimal query execution plans. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'98), pages 106-117, 1998. [ bib | .pdf | .pdf ]
[cogr94] Richard L. Cole and Goetz Graefe. Optimization of dynamic query evaluation plans. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'94), pages 150-160, 1994. [ bib | .pdf ]
How to produce dynamic query evaluation plans that include ChoosePlan operators. Generalizes the optimizer so that it understands that cost estimates may only partially order the candidate evaluation plans.
[grae93] Goetz Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-169, 1993. [ bib | http | .pdf ]
[iong92] Yannis E. Ioannidis, Raymond T. Ng, Kyuseok Shim, and Timos K. Sellis. Parametric query optimization. In 18th International Conference on Very Large Data Bases (VLDB'92), pages 103-114, August 1992. [ bib | .PDF | .pdf ]