A Conservative Multiversion Locking-Graph Scheduler Algorithm  

作　　者：陈昉 施伯乐 

机构地区：[1]Department of Computer Science,Fudan University,Shanghai 200433

出　　处：《Journal of Computer Science & Technology》1991年第2期161-166,共6页计算机科学技术学报（英文版）

摘　　要：In order to improve the concurrency of multiversion database systems,a conservative MV locking-graph scheduler algorithm is proposed,which takes the power of MVS as a target.The algorithm combines the advantages of locking and graph,and does optimizing processes on read-only and write-only operations to reduce the blocks of transactions.The correctness and com- plexity of the algorithm are also provided.In order to improve the concurrency of multiversion database systems,a conservative MV locking-graph scheduler algorithm is proposed,which takes the power of MVS as a target.The algorithm combines the advantages of locking and graph,and does optimizing processes on read-only and write-only operations to reduce the blocks of transactions.The correctness and com- plexity of the algorithm are also provided.

关 键 词：node cycle SG A Conservative Multiversion Locking-Graph Scheduler Algorithm 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]