Comparison of Different Solutions for Solving the Optimization Problem of Large Join Queries
The article explores the optimization of queries using genetic algorithms and compares it with the conventional query optimization component. Genetic algorithms (GAs), as a data mining technique, have been shown to be a promising technique in solving the ordering of join operations in large join que...
Saved in:
| Published in | 2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications pp. 51 - 55 |
|---|---|
| Main Author | |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.04.2010
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 9781424460816 1424460816 |
| DOI | 10.1109/DBKDA.2010.1 |
Cover
| Summary: | The article explores the optimization of queries using genetic algorithms and compares it with the conventional query optimization component. Genetic algorithms (GAs), as a data mining technique, have been shown to be a promising technique in solving the ordering of join operations in large join queries. In practice, a genetic algorithm has been implemented in the PostgreSQL database system. Using this implementation, we compare the conventional component for an exhaustive search with the corresponding module based on a genetic algorithm. Our results show that the use of a genetic algorithm is a viable solution for optimization of large join queries, i.e., that the use of such a module outperforms the conventional query optimization component for queries with more than 12 join operations. |
|---|---|
| ISBN: | 9781424460816 1424460816 |
| DOI: | 10.1109/DBKDA.2010.1 |