DocumentCode :
2923973
Title :
A combination method for join ordering problem in relational databases using genetic algorithm and ant colony
Author :
Kadkhodaei, HamidReza ; Mahmoudi, Fariborz
Author_Institution :
Dept. Electr. & Comput. Eng., Islamic Azad Univ., Tehran, Iran
fYear :
2011
fDate :
8-10 Nov. 2011
Firstpage :
312
Lastpage :
317
Abstract :
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.
Keywords :
ant colony optimisation; genetic algorithms; query processing; relational databases; NP-complete problem; ant colony algorithm; combination method; execution plan; genetic algorithm; join ordering problem; query execution; relational databases; Biological cells; Classification algorithms; Convergence; Genetic algorithms; Genetics; Next generation networking; Optimization; Ant Colony; Genetic Algorithm; Join Ordering; Query Optimization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2011 IEEE International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-1-4577-0372-0
Type :
conf
DOI :
10.1109/GRC.2011.6122614
Filename :
6122614
Link To Document :
بازگشت