A Conservative Multiversion Locking-Graph Scheduler Algorithm

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.