数据立方体实体化的多目标遗传算法  

Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses

作　　者：陈佳[1] 李敏[1] 

机构地区：[1]武汉纺织大学数学与计算机学院,武汉430073

出　　处：《计算机工程与应用》2012年第25期154-158,共5页Computer Engineering and Applications

基　　金：湖北省教育厅中青年科技项目(No.20111613)

摘　　要：多维数据实视图选择问题是一个NP完全问题。提出一种基于约束的多目标优化遗传算法,将查询代价和维护代价分开考虑,更有效地解决复杂的实视图选择问题。实验结果表明,该算法具有更好的性能,特别是在获得的Pareto前沿的分布性上。The data cube selection problem is known to be an NP-hard problem. This paper presents an evolutionary algorithm in which query cost and maintenance cost are considered separately for constrained optimization and more effectively addresses the complex view-selection problem. The experimental results show that the multi-objective optimization algorithm has better performance, especially in the distribution of the obtained Pareto front.

关 键 词：多目标优化 遗传算法 数据仓库 视图选择 

分 类 号：TP391.4[自动化与计算机技术—计算机应用技术]