Simulated annealing and genetic algorithm based querying for xml databases

In this study, simulated annealing and genetic algorithm based XML querying has been implemented. In the XML query, joining all nodes in the query tree have been done regularly. During constructing query execution plan, the join order of nodes is the most important factor to determine the cost of the query. In this study, the join order of the nodes have been done with genetic and simulated annealing algorithms, and the results of both algorithms have been compared. Application has been developed using C# 2.0 language and implemented using the open source Timber XML database management system. In the experimental results it has been showed that simulated annealing and genetic algorithms which are implemented more easily than classical methods have been successfully applied for optimization of XML query. Key Words : XML, XQuery, Query Optimization, Join Order, Genetic Algorithm, Sımulated Annealıng, System-R, Bushy Tree, SQL, Querying Data, Timber