作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (3): 108-110. doi: 10.3969/j.issn.1000-3428.2008.03.038

• 软件技术与数据库 • 上一篇    下一篇

一种改进的动态调整串行化顺序算法

边 远,杨 静,卢大勇   

  1. (哈尔滨工程大学计算机科学与技术学院,哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-02-05 发布日期:2008-02-05

Improved Algorithm of Dynamic Adjustment of Serialization Order

BIAN Yuan, YANG Jing, LU Da-yong   

  1. (College of Computer Science and Technology, Harbin Engineering University, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-05 Published:2008-02-05

摘要: 乐观并发控制协议比锁机制更适用于实时数据库,但其中存在着不必要的重启及重大重启。该文针对OCC-TI算法的不足,将动态调整串行化顺序方法从优先权和最终时间戳选择机制2方面进行了扩展,提出了新的基于时间戳的并发控制算法——OCC-CPTI。仿真实验证明,OCC-CPTI算法在性能上优于OCC-TI。

关键词: 实时数据库, 乐观并发控制, 串行化顺序

Abstract: Although optimistic concurrency control approach is better than locking protocols for Real-time Database System(RTDBS), it has the problems such as unnecessary restarts and heavy restart overhead. This paper identifies the unnecessary restart problem in OCC-TI and proposes two extensions to the basic dynamic adjustment of the serialization order conflict resolution method used in OCC-TI. A new protocol named OCC-CPTI based on timestamp interval is proposed. Experiments with prototype implementation of a real-time database system show that the method outperforms the original OCC-TI method.

Key words: real-time database, optimistic concurrency control, serialization order

中图分类号: