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

弱可串行分布式实时事务并发控制
引用本文:党德鹏,刘云生,潘琳.弱可串行分布式实时事务并发控制[J].上海大学学报(英文版),2002,6(4):325-330.
作者姓名:党德鹏  刘云生  潘琳
作者单位:CollegeofComputerScienceandTechnology,HuazhongUniversityofScienceandTechnology,Wuhan430074,China
基金项目:ProjectsupportedbytheNationalNaturalScienceFoundationof China (60 0 73 0 45 )andtheCommissionofScience,Technology andIndustryforNationalDefenseofChina (0 0J15 .3 .3 . JW 0 5 2 9)
摘    要:Most of the proposed concurrency control protocols for real-time database systems are based on serializability theorem.Owing to the unique characteristics of real-time database applications and the importance of satisfying the timing constraints of transactions,serializability is too strong as a correctness criterion and not suitable for real-time databases in most cases.On the other hand,relaxed serializability including epsilon-serializability and similarity-serializability can allow more real-time transactions to satisfy their timing constraints,but database consistency may be sacrificed to some extent.We thus propose the use of weak serializability(WSR)that is more relaxed than conflicting serializability while database consistency is maintained.In this paper,we first formally define the new notion of correctness called weak serializability.After the necessary and sufficient conditions for weak serializability are shown,corresponding concurrency control protocol WDHP(weak serializable distributed high prority protocol)is outlined for distributed real time databases,where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency.Finally,through a series of simulation studies,it is shown that using the new concurrency control protocol the performance of distributed realtime databases can be greatly improved.

关 键 词:实时事务并发控制  实时数据库系统  弱可串行分布式系统  数据库管理系统
收稿时间:22 January 2002

Weak serializable concurrency control in distributed real-time database systems
Dang?De-Peng,Liu?Yun-Sheng,Pan?Lin.Weak serializable concurrency control in distributed real-time database systems[J].Journal of Shanghai University(English Edition),2002,6(4):325-330.
Authors:Dang De-Peng  Liu Yun-Sheng  Pan Lin
Institution:College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Abstract:Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.
Keywords:distributed real  time database systems  relaxed serializability  real  time concurrency control  read  only transactions  
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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