摘要： 对于定义在若干基本表上的物化视图，当基本表发生变化时，物化视图也需要相 应地更新，如何有效地进行物化视图的增量保持是一个非常重要的问题。文章提出了一种在 O(nlogn)时间内构造最优Delta传播树的二分贪心算法，并给出了算法正确性证明。

关键词: 物化视图, 增量保持, Delta传播树, 划分

Abstract: For materialized views defined over some base relations, when the ba se relations change, these views need corresponding refreshment. It is a very im portant problem to maintain materialized views efficiently. In this paper, an im proved greedy algorithm is proposed to construct an optimal delta propagation tr ee according to which the increasement of a materialized view can be computed in O(nlogn) time.

中图分类号: 

• TP391.41