A combination method for join ordering problem in relational databases using genetic algorithm and ant colony

Optimization of the join ordering in query is aimed at finding an execution plan so that total cost for execution of query could be minimized. In general, this problem is considered as NP-Complete. Yet, various methods have been proposed for the problem. In this paper, the problem of optimization of the join ordering has been solved using combination of genetic algorithm and ant colony algorithm. The result shows that the proposed solution, totally, is of shorter execution time and higher convergence speed than existing methods.