作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (12): 90-92. doi: 10.3969/j.issn.1000-3428.2007.12.032

• 软件技术与数据库 • 上一篇    下一篇

物化视图合并的一种新算法

咸 兵   

  1. (清华大学软件学院,北京 100084)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-20 发布日期:2007-06-20

A New Algorithm for Merging Materialized Views

XIAN Bing   

  1. (School of Software, Tsinghua University, Beijing 100084)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-20 Published:2007-06-20

摘要: 用视图优化查询是提高数据库响应性能的重要手段,所以减少视图的搜索空间有非常重要的意义。该文提出了视图合并的一种新算法――匹配合并法,该算法大大地扩展了视图合并范围。为了更快地进行匹配合并,还提出了一种有效的索引结构――双分解树,通过分解视图集来达到快速合并视图的目的。实验表明,该合并算法改进了数据库的查询性能。

关键词: 物化视图, 匹配合并, 双分解树

Abstract: Materialized views can improve the database’s performance, but numbers of materialized views will cost lots of spaces. So, it is necessary to decrease the number of the materialized views by merging. This paper gives a new algorithm named match merging. In order to accelerate the merging process, it introduces the two-partitioned tree, which is a kind of index. According to experiment, it is very useful.

Key words: Materialized views, Match merging, Two-partitioned tree

中图分类号: