物化视图选择算法——ACSSA_VSP  

Materialized view selection algorithm——ACSSA_VSP

作　　者：张宇航[1] 孙劲光[2] 

机构地区：[1]辽宁工程技术大学技术与经济学院,辽宁阜新123000 [2]辽宁工程技术大学电子与信息学院,辽宁葫芦岛125100

出　　处：《微计算机信息》2011年第1期213-215,共3页Control & Automation

基　　金：基金申请人:孙劲光;项目名称:数字化矿山数据仓库模型的研究;基金颁发部门:煤炭工业协会(MTKJ2009-242);基金申请人:邵良杉;项目名称:基于数据挖掘的煤矿灾害预测研究;基金颁发部门:国家自然科学基金(70971059)

摘　　要：本文对提高数据仓库查询效率的物化视图选择问题进行了研究。通过研究与实验,提出了一种改进的克隆选择算法解决物化视图选择问题,即在克隆选择算法变异过程中引入模拟退火算法的Metropolis准则,在保证抗体多样性的条件下提高了算法运行效率,同时在克隆选择算法选择过程中实现了每代更新数的自适应调节。由此提出了解决物化视图选择问题的自适应克隆选择模拟退火算法——ACSSA_VSP。理论分析和实验验证表明:ACSSA_VSP比解决物化视图选择问题常用的标准遗传算法求解质量更高、收敛速度更快。In this paper,materialized view selection problem which can improve data warehouse query efficiency is studied.Through research and experiments,this paper proposes an improved clonal selection algorithm to solve materialized view selection problem,that is in the variation process of clonal selection algorithm the Metropolis criterion of simulated annealing algorithm is introduced which could improve algorithm running efficiency in the condition of ensuring antibody diversity,and at the same time in the selection process of clonal selection algorithm,the improved clonal selection algorithm realizes self adaptive adjustment of each generation renewal number.Thus this paper proposes adaptive clonal selection simulation annealing algorithm——ACSSA_VSP.Theoretical analysis and experimental verification show：ACSSA_VSP has better solution quality and quicker convergence speed than standard genetic algorithm often used to solve materialized view selection problem.

关 键 词：数据仓库 物化视图 自适应克隆选择模拟退火算法 数据立方体的格 

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