Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (3): 22-22.

• 博士论坛 • Previous Articles     Next Articles

Research and Realization on Query_Cost View Selection Problem

Zhou Li-Juan Hao Zhongxiao Wu Minhua   

  • Received:2006-09-30 Revised:1900-01-01 Online:2007-01-21 Published:2007-01-21
  • Contact: Zhou Li-Juan

查询代价视图选择问题的研究及实现

周丽娟 郝忠孝 吴敏华   

  1. 首都师范大学;哈尔滨工业大学 哈尔滨工业大学; 哈尔滨理工大学 首都师范大学
  • 通讯作者: 周丽娟

Abstract: One of the most problems in a data warehouse is the selection of views to materialize. Materialized views are stored in a data warehouse for the purpose of efficiently implementing on-line analytical processing queries. A query response time is the first issue for user’s requirement. So,this paper proposes view selection problem based on query cost and its cost model. The paper presents solution and strategy using genetic algorithm.The experimental study shows that the algorithm has better solutions and high efficiency.

Key words: data warehouse , materialized view, view selection , genetic algorithm

摘要: 实视图选择问题是数据仓库研究的重要问题之一。数据仓库存储实视图主要为OLAP查询,用户查询响应时间是首要考虑的问题,本文提出查询代价视图选择问题,给出了其代价模型。提出对查询代价视图选择问题利用遗传算法来解决的方法和策略。经实验证明,该算法达到了良好的效果,效率高。

关键词: 数据仓库, 实视图, 视图选择, 遗传算法