期刊文献+

事务并发控制中的两段锁和可串行化冲突图的对比

The comparison of two-phase locking and serialization graph testing in concurrency control of transaction
下载PDF
导出
摘要 数据库中并发操作一般分为数据级和事务级两种,由于资源的竞争可能引起数据级的冲突和事务级的冲突,因此需要对并发执行的事务转化为某个可串行化调度,从而确保数据库的一致性.目前并发控制的方法有很多,从锁和非锁机制两个方面分析了两段锁和可串行化冲突图两种并发控制的规则和数据结构及分类,并从事务的冲突可串行化方面和结构上分析了各自的性能和优缺点. The concurrent operations are classified into data level and transaction level. Due to the competition of resoures,the data level and transaction level conflicts can be brought.So the execution of concurrent transactions have to be transferred some serializable schedule so as to insure the consistency of database. At present there are many concurrency control methods in database system,analyse two concurrency control methods including two-phase locking and serialization graph from the aspect of locking mechanism and non-locking mechanism,introduce the rules and data structures,and then compare their strongpoints and drawbacks of performance from the conflict serializability of transaction and the structures of concurrency control.
作者 金蓉 李跃新
出处 《湖北大学学报(自然科学版)》 CAS 北大核心 2005年第1期19-23,共5页 Journal of Hubei University:Natural Science
关键词 可串行化 事务 并发控制 并发操作 锁机制 并发执行 数据库 冲突 竞争 资源 locking two-phase locking serialization graph testing
  • 相关文献

参考文献4

  • 1Ngamsuriyaroj S,Keefe T,Hurson A.Maintaining consistency of the security policy using timestamp ordering[A].Bob Werner.Coding and computing[C].Las Vegas:IEEE Computer Society,2002.164~170.
  • 2Hung S L,Lam K W,Lam K Y.Efficient technique for performance analysis of locking protocols[A].Vijay K Madisetti,Erol Gelenbe,Jean C Walrand.Modeling analysis and simulation of computer and telecommunication systems[C].Durham,NC USA:IEEE Computer Society,1994.276~283.
  • 3Kozak P,Wonham W M.Design of transaction management protocols[J].IEEE Transactions on Automatic Control,1996,41(9):1330~1335.
  • 4Margaret Heich.Graph directed locking[J].IEEE Transaction on Software Engineering,1998,14(2):133~140.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部