Paper Info
Title
CGO: a sound genetic optimizer for cyclic query graphs
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 DatabaseTM(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.
Year
DOI
Venue
2006
10.1007/11758501_25
International Conference on Computational Science (1)
Keywords
Field
DocType
universal databasetm,carquinyoli genetic optimizer,increasing number,standalone optimizer,large number,sound genetic optimizer,genetic programming,db2 udb,query plan,cyclic query graph,sound optimizer,dynamic programming,genetics
Query optimization,Dynamic programming,Joins,Search algorithm,Computer science,Algorithm,Theoretical computer science,Genetic programming,Best execution,Genetic algorithm,Distributed computing,Query plan
Conference
Volume
ISSN
ISBN
3991
0302-9743
3-540-34379-2
Citations 
PageRank 
References 
6
0.55
6
Authors
4
Name
Order
Citations
PageRank
Victor Muntés-Mulero120422.79
Josep Aguilar-Saborit2868.01
Calisto Zuzarte326031.97
Josep-L. Larriba-Pey416217.44