首页 | 本学科首页   官方微博 | 高级检索  
     

数据仓库中多数据源物化视图的一种有效更新算法
引用本文:王新军,洪晓光,王海洋,马绍汉.数据仓库中多数据源物化视图的一种有效更新算法[J].计算机研究与发展,2004,41(5):874-879.
作者姓名:王新军  洪晓光  王海洋  马绍汉
作者单位:山东大学计算机科学与技术学院,济南,250100
基金项目:国家自然科学基金项目 ( 69973 0 2 8),国家“八六三”高技术研究发展计划基金项目 ( 2 0 0 2AA4113 10 )
摘    要:数据仓库中存储着大量的汇总数据以支持查询和相关决策的制定,这些汇总数据常常是定义在若干数据源上的物化视图.当数据源发生变化时,物化视图也需要相应的更新,这必然给数据仓库带来庞大的开销,因而如何有效地对物化视图进行更新成为一个非常重要的问题.利用BinPartition算法可以使计算费用达到最低,随后证明了该算法的正确性并分析了其时间复杂性.

关 键 词:数据仓库  物化视图  基本关系  划分

An Efficient Refreshment Algorithm for Materialized View in Data Warehouse with Multiple Sources
WANG Xin Jun,HONG Xiao Guang,WANG Hai Yang,and MA Shao Han.An Efficient Refreshment Algorithm for Materialized View in Data Warehouse with Multiple Sources[J].Journal of Computer Research and Development,2004,41(5):874-879.
Authors:WANG Xin Jun  HONG Xiao Guang  WANG Hai Yang  and MA Shao Han
Abstract: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
Keywords:data warehouse  materialized view  base relation  partition  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号