publication . Article . 2008

An Adaptive Genetic Algorithm with Dynamic Population Size for Optimizing Join Queries

Vellev, Stoyan;
Open Access English
  • Published: 01 Jan 2008
  • Publisher: Institute of Information Theories and Applications FOI ITHEA
  • Country: Bulgaria
The problem of finding the optimal join ordering executing a query to a relational database management system is a combinatorial optimization problem, which makes deterministic exhaustive solution search unacceptable for queries with a great number of joined relations. In this work an adaptive genetic algorithm with dynamic population size is proposed for optimizing large join queries. The performance of the algorithm is compared with that of several classical non-deterministic optimization algorithms. Experiments have been performed optimizing several random queries against a randomly generated data dictionary. The proposed adaptive genetic algorithm with proba...
Persistent Identifiers
arXiv: Computer Science::Databases
free text keywords: Genetic Algorithms, Query Optimization, Join Ordering, Randomized Algorithms, Query Processing
Related Organizations
Any information missing or wrong?Report an Issue