By Topic

Query optimization in distributed database using hybrid evolutionary algorithm

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
$33 $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

3 Author(s)
Morteza Nasiraghdam ; Department of computer engineering Islamic Azad University of Ahar branch, Ahar, Iran ; Shahriar Lotfi ; Reza Rashidy

Join execution order, suitable copy selection from a query tables, join execution location selection and semijoin strategy are effective agents of a query's execution plan's cost. The selection of an optimal hybrid among these for agents for finding an execution plan is whit lowest cost of NP-Complete problems that in this paper is used from a hybrid evolutionary algorithm (EALA) for solving of this problem. This algorithm has used combination genetic algorithm and learning automata for producing optimal execution plan for a query. In this paper we compare the results from hybrid algorithm whit the results of genetic algorithm execution meaningful results are achieved.

Published in:

Information Retrieval & Knowledge Management, (CAMP), 2010 International Conference on

Date of Conference:

17-18 March 2010