摘要
数据仓库中存储着大量的汇总数据以支持查询和相关决策的制定 ,这些汇总数据常常是定义在若干数据源上的物化视图 当数据源发生变化时 ,物化视图也需要相应的更新 ,这必然给数据仓库带来庞大的开销 ,因而如何有效地对物化视图进行更新成为一个非常重要的问题 利用BinPartition算法可以使计算费用达到最低 。
Data warehouses store a large amount of summarized data in form of materialized views defined over some source relations to support querying and decision making When data sources change, these views need to be updated in time These impose a significant overhead on the warehouse, so it is a very important problem to incrementally maintain materialized views efficiently A BinPartition algorithm is proposed to construct an optimal delta propagation tree according to which the cost of view maintenance is minimal The correctness and time complexity of the algorithm are also given
出处
《计算机研究与发展》
EI
CSCD
北大核心
2004年第5期874-879,共6页
Journal of Computer Research and Development
基金
国家自然科学基金项目 ( 69973 0 2 8)
国家"八六三"高技术研究发展计划基金项目 ( 2 0 0 2AA4113 10 )
关键词
数据仓库
物化视图
基本关系
划分
data warehouse
materialized view
base relation
partition
