Research Article Open Access

Real-time Optimistic Concurrency Control based on Transaction Finish Degree

Han Qilong and Hao Zhongxiao

Abstract

Concurrency control is one of the main issues in the studies of real-time database systems. Optimistic concurrency control algorithms have the attractive properties of being non-blocking and deadlock-free. However, they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order in real-time database systems, they are still some unnecessary transaction restarts. In this study, we propose a new method called Transaction Finish Degree (TFD) and a new Multiversion Optimistic Concurrency Control algorithm based on TFD (MVOCC-TFD), which can reduce the number of unnecessary restarts. Theoretical analysis and experimental results demonstrate that the new algorithm can outperform the previous ones.

Journal of Computer Science
Volume 1 No. 4, 2005, 471-476

DOI: https://doi.org/10.3844/jcssp.2005.471.476

Submitted On: 8 May 2005 Published On: 31 December 2005

How to Cite: Qilong, H. & Zhongxiao, H. (2005). Real-time Optimistic Concurrency Control based on Transaction Finish Degree. Journal of Computer Science, 1(4), 471-476. https://doi.org/10.3844/jcssp.2005.471.476

  • 2,432 Views
  • 2,392 Downloads
  • 1 Citations

Download

Keywords

  • real-time database
  • concurrency
  • scheduling algorithm
  • transaction finish degree