| 数据立方体实体化的多目标遗传算法 |
| |
| 引用本文： | 陈佳,李敏. 数据立方体实体化的多目标遗传算法[J]. 计算机工程与应用, 2012, 48(25): 154-158 |
| |
| 作者姓名： | 陈佳 李敏 |
| |
| 作者单位： | 武汉纺织大学 数学与计算机学院，武汉 430073 |
| |
| 基金项目： | 湖北省教育厅中青年科技项目(No.20111613) |
| |
| 摘 要： | 多维数据实视图选择问题是一个NP完全问题。提出一种基于约束的多目标优化遗传算法，将查询代价和维护代价分开考虑，更有效地解决复杂的实视图选择问题。实验结果表明，该算法具有更好的性能，特别是在获得的Pareto前沿的分布性上。
|
| 关 键 词： | 多目标优化 遗传算法 数据仓库 视图选择 |
Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses |
| |
| CHEN Jia , LI Min. Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses[J]. Computer Engineering and Applications, 2012, 48(25): 154-158 |
| |
| Authors: | CHEN Jia LI Min |
| |
| Affiliation: | School of Mathematics and Computer Science, Wuhan Textile University, Wuhan 430073, China |
| |
| Abstract: | 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. |
| |
| Keywords: | multiobjective optimization genetic algorithms data warehouse view selection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
