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

A Conservative Multiversion Locking-Graph Scheduler Algorithm
作者姓名:Chen Fang  Shi Baile
作者单位:[1]DepartmentofComputerScience,FudanUniversity,Shanghai200433 [2]DepartmentofComputerScience,FudanUniversit
摘    要: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 complexity of the algorithm are also provided.

关 键 词:数据库系统  数据查询  优化处理

A conservative multiversion locking-graph scheduler algorithm
Chen Fang,Shi Baile.A Conservative Multiversion Locking-Graph Scheduler Algorithm[J].Journal of Computer Science and Technology,1991,6(2):161-166.
Authors:Fang Chen  Baile Shi
Affiliation:Department of Computer Science Fudan University; Shanghai; Department of Computer Science; Fudan University;
Abstract: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 transctions. The correctness and complexity of the algorithm are also provided.
Keywords:
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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