检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大庆石油学院计算机科学与信息技术学院,黑龙江大庆163318
出 处:《郑州轻工业学院学报(自然科学版)》2007年第6期44-47,50,共5页Journal of Zhengzhou University of Light Industry:Natural Science
基 金:黑龙江省教育厅科学技术研究项目(11521006);黑龙江省自然科学基金项目(2005G3674-00)
摘 要:结合多连接查询的特点,提出将侧重于全局搜索的遗传算法与侧重于局部搜索的模拟退火算法相结合的数据库多连接查询优化算法:先从一组随机产生的初始种群开始全局最优解的搜索,通过选择、交叉、变异等遗传操作产生新一代种群,然后对新个体进行模拟退火操作,将结果作为下一代种群中的个体.如此反复迭代进行,到满足最终条件为止.仿真实验验证了该算法的有效性.The algorithm of multi-joint query optimization based on genetic algorithm with overall search ability and simulated annealing with local search ability are proposed by combining with characteristic of multi-join optimization:Starting an optimal-solution-search to the overall situation in a group of initial population, which is random selected. A new generation of population will be produced after the selection strategy, crossover and mutation. And then the simulated annealing is applied to those new populations, and the result is used as the unit of the next generation population. The above process is operated repeatedly and iterativey, until the result meets the the final qualification. The simulation experiment has proved its efficiency.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249