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

Improved Algorithm of Dynamic Adjustment of Serialization Order

作　　者：边远[1] 杨静[1] 卢大勇[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机工程》2008年第3期108-110,共3页Computer Engineering

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

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]