Application of Ant Colony Optimization Algorithm to Multi-Join Query Optimization

Multi-join query optimization (MJQO) is an important technique for designing and implementing database manage system. It is a crucial factor that affects the capability of database. This paper proposes a new algorithm to solve the problem of MJQO based on ant colony optimization (ACO). In this paper, details of the algorithm used to solve MJQO problem have been interpreted, including how to define heuristic information, how to implement local pheromone update and global pheromone update and how to design state transition rule. After repeated iteration, a reasonable solution is obtained. Compared with genetic algorithm, the simulation result indicates that ACO is more effective and efficient.