计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (25): 154-158.
• 数据库、信号与信息处理 • 上一篇 下一篇
陈 佳，李 敏
出版日期:
发布日期:
CHEN Jia, LI Min
Online:
Published:
摘要： 多维数据实视图选择问题是一个NP完全问题。提出一种基于约束的多目标优化遗传算法，将查询代价和维护代价分开考虑，更有效地解决复杂的实视图选择问题。实验结果表明，该算法具有更好的性能，特别是在获得的Pareto前沿的分布性上。
关键词: 多目标优化, 遗传算法, 数据仓库, 视图选择
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.
Key words: multiobjective optimization, genetic algorithms, data warehouse, view selection
陈 佳，李 敏. 数据立方体实体化的多目标遗传算法[J]. 计算机工程与应用, 2012, 48(25): 154-158.
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.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2012/V48/I25/154
