自适应逃逸动量粒子群算法的数据库多连接查询优化  

Multi-join query optimization of database based on self-adaptive escape velocity momentum particle swarm optimization algorithm

作　　者：郑先锋[1] 王丽艳[1] 

机构地区：[1]重庆邮电大学移通学院计算机科学系,重庆401520

出　　处：《四川大学学报（自然科学版）》2013年第3期494-498,共5页Journal of Sichuan University(Natural Science Edition)

基　　金：国家自然科学基金(61075019);国家技术创新基金资助项目(11C26214302856)

摘　　要：为了提高数据库多连接查询的优化效率,针对粒子群算法存在的早熟、局部最优等缺陷,提出一种自适应逃逸动量粒子群算法的数据库多连接查询优化方法.该算法首先将遗传算法的交叉机制引入粒子群算法中,以保持粒子群的多样性,避免早熟现象出现;然后,引入动量算法平滑粒子搜索轨迹,加快粒子群的收敛速度;最后,将该算法应用于数据库多连接查询优化求解,以获得最优的数据库多连接查询方案.仿真结果表明,该算法提高了数据库查询效率,缩短了查询响应时间.In order to improve the multi-join query optimization etticiency, this paper proposeci a multtjoin query optimization of database based on self-adaptive escape velocity particle swarm optimization algorithm, which because the particle swarm optimization algorithm has premature, Local optimum etc defects. Firstly, the crossover mechanism of genetic algorithm is introduced into PSO to keep the diversity of particle swarm and avoid premature phenomenon. And then the momentum algorithm is introduced to smooth the trajectory of particle search and speed up the convergence. Finally, this algorithm is applied to solve multi-join query optimization of database to obtain the optimal solution. The simulation results show that this proposed algorithm improves the query efficiency, reduce the query response time.

关 键 词：数据库查询 粒子群算法 动量算法 遗传算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]