计算机应用 ›› 2005, Vol. 25 ›› Issue (04): 814-816.DOI: 10.3724/SP.J.1087.2005.0814

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

一种实化视图的合并算法

陈长清1,程恳2   

  1. 1.华中科技大学软件学院; 2.华中科技大学继续教育学院
  • 发布日期:2005-04-01 出版日期:2005-04-01
  • 基金资助:

    国家自然科学基金资助(60303030)

Algorithm for merging materialized views

CHEN Chang-qing1,CHENG Ken2   

  1. 1.School of Software,Huazhong University of Science and Technology,Wuhan Hubei 430074,China; 2.School of Continuing Education,Huazhong University of Science and Technology,Wuhan Hubei 430074,China
  • Online:2005-04-01 Published:2005-04-01

摘要:

对于拥有大量实化视图的实际数据库应用系统,提出了视图合并的方法以减少整个视图 的数量,缩减实化视图的搜索空间;还提出了归并树和基于归并树的快速有效的合并算法。实验表 明,实化视图的合并是快速寻找可能响应查询的实化视图的一种有效途径,可以显著改进查询处理的 性能。

关键词: 实化视图, 视图合并, 归并树

Abstract:

For a real database application system with large numbers of materialized views, view merging was introduced to decrease the number of total views so as to reduce the search space. A merging tree was described and an efficient merging algorithm was presented based on such tree. Experiment results show that view merging is an efficient approach to fast search those materialized views that may be used to answer a query, and can improve the performance of query processing observably.

Key words: materialized view, view merging, merging tree

中图分类号: