An Improved Join Query Optimization Method for Distributed Databases using Multi Colony Ant Algorithm

Abstract

In distributed databases, relations are scattered on multiple sites by either replicating newlinethe data or by fragmenting the data. To process any query that contains multiple relations, newlinemultiple sites may participate in finding out the solution. A query that involves multiple newlinerelations needs to join these relations first across multiple sites and this join has to be done newlinewith optimal utilization of resources in optimal time. newlineWhen a query is submitted to the database, the query optimizer generates multiple newlineQuery Execution Plans. The plan that generates the result with optimal resources in optimal newlinetime is chosen by the optimizer for execution of the query. The relations in the query are newlinejoined for obtaining these results, and the join order is the primary contributor for the efficient newlineperformance of a query optimizer. The join order problem is one of the most studied problems newlinein database query optimization. newline