摘要： 提出用依赖图方法判断数据仓库实例化视图调度是否可串行化。对传统的２ＰＬ协议冲突操作概念加以扩展，就可构造出依赖图。如果依赖图无环，实例化视图事务调度就是串行化调度。还设计了事务调度的数据仓库新结构和Ｓｅｒｉ－Ｓｃｈｅ算法。
关键词:
可串行化调度,
派生集合,
冲突操作,
Seri－Sche算法
Abstract: In this article we propose our concurrency control theory for data warehouse materialized view to ensure the data consistency ofdata warehouse. The article decribes one rule determining the serializability based on the conventional 2PL protocol.
中图分类号:
焦容,虞险云,严哲南,陈金海. 视图事务经历的串行化调度分祈[J]. , 1999, 25(12): 70-72.
Jiao Rong, Yu Xianyun, Yan Zhenan, Chen Jinhai. Concurrency Control Theory for Data Warehouse Materialized View[J]. , 1999, 25(12): 70-72.