This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Towards a General Concurrency Control Algorithm for Database Systems
October 1987 (vol. 13 no. 10)
pp. 1073-1079
A.A. Farrag, Department of Mathematics and Computing Science, Dalhousie University
The concurrency control problem in database systems has been examined by many people and several concurrency control algorithms have been proposed. The most popular algorithms are two-phase locking and timestamp ordering. This paper shows that two-phase locking and timestamp ordering are special cases of a more general concurrency control algorithm. This general algorithm is described in detail and is proven to work correctly. We show that two-phase locking and timestamp ordering represent the two end points of a series of concurrency control algorithms. Each of them is a special case of the general algorithm proposed in this paper. Moreover, each of these special cases can be selected in advance, and can even be changed dynamically during execution.
Index Terms:
two-phase locking, Concurrency control, database, deadlock, strictness level, timestamp ordering
Citation:
A.A. Farrag, M.T. Ozsu, "Towards a General Concurrency Control Algorithm for Database Systems," IEEE Transactions on Software Engineering, vol. 13, no. 10, pp. 1073-1079, Oct. 1987, doi:10.1109/TSE.1987.232849
Usage of this product signifies your acceptance of the Terms of Use.