Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kadkhodaei, H. ; Dept. Electr. & Comput. Eng., Islamic Azad Univ., Tehran, Iran ; Mahmoudi, F.

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.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.