摘要
查询计划的一棵左深树看作是一个粒子,对于左深树上的连接操作后序遍历生成一个编码,对粒子群进行速度和位置更新操作,并通过引混沌搜索机制,对粒子进行混沌扰动,保证粒子群个体的多样性,最后通过粒子间的信息共享与传递找到最优数据库查询优化方案。
Query plan for a left deep tree is taken as a particle, the left deep tree is coded by the traversal, the particle swarm＇ velocity and position are updated, and by introducing the chaos search mechanism to solve the particle chaos＇s perturbation and ensure particle swarm diversity, finally the optimal database query optimization is found by sharing and transfer of information.
出处
《科技通报》
北大核心
2012年第4期116-118,共3页
Bulletin of Science and Technology
关键词
粒子群算法
数据库
多连接
查询优化
particle swarm optimization algorithm
database
multi-joint
query optimization
