摘要
改进了基于模拟退火遗传算法的代价评估的计划查询优化策略.其基本思想为:将多连接查询按遗传算法步骤求解,其中选择操作采用最优选择法、交叉和变异操作采用自适应算子,然后对其结果进行退火操作以产生下一代.
According to characteristics of multi-join inquiry,and advantages and disadvantages of simulated annealing and genetic algorithm,in this paper,it improved to the query optimization strategy based on improved simulated annealing and genetic algorithm.Basic idea： there are many steps of the genetic algorithm to solveing the multi-join inquiry problem,its selection operator is the most the optimal selection strategy,and crossover and mutation operators are adaptive operators,then,the next generation is produced by annealing operation to results of above the steps.
出处
《微电子学与计算机》
CSCD
北大核心
2008年第11期182-184,共3页
Microelectronics & Computer
基金
西安市工业科技攻关项目(JJ05020)
关键词
模拟退火遗传算法
多连接查询
优化
数据库
simulated annealing and genetic algorithm
multi-join inquiry
optimization
database
