Abstract
The increasing number of applications requiring the use of large join queries reinforces the search for good methods to determine the best execution plan. This is especially true, when the large number of joins occurring in a query prevent traditional optimizers from using dynamic programming. In this paper we present the Carquinyoli Genetic Optimizer (CGO). CGO is a sound optimizer based on genetic programming that uses a subset of the cost-model of IBM®DB2®Universal Database™ (DB2 UDB) for selection in order to produce new generations of query plans. Our study shows that CGO is very competitive either as a standalone optimizer or as a fast post-optimizer. In addition, CGO takes into account the inherent characteristics of query plans like their cyclic nature. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Muntés-Mulero, V., Aguilar-Saborit, J., Zuzarte, C., & Larriba-Pey, J. L. (2006). CGO: A sound genetic optimizer for cyclic query graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 156–163). Springer Verlag. https://doi.org/10.1007/11758501_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
