Real-time Optimistic Concurrency Control based on Transaction Finish Degree
Han Qilong & Hao Zhongxiao
Journal of Computer Science, Volume 1, Issue 4, pp. 471–476 · doi.org/10.3844/jcssp.2005.471.476
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2005 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
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
- Licence
- © Science Publications
- Issue
- Volume 1, Issue 4
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
