This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M.J. Carey, Department of Computer Sciences, University of Wisconsin
This correspondence describes and analyzes two schemes for improving the performance of serial validation, an optimistic concurrency control algorithm proposed by Kutng and Robinson. It is shown that timestamp-based techniques can be used to implement serial validation, yielding an equivalent algorithm with a much lower validation cost. A multiple version variant of serial validation is then presented, and simulation results indicate that multiversion serial validation has significant performance advantages over the single version algorithm.
Index Terms:
transaction processing, Concurrency control, database systems, modeling and simulation
Citation:
M.J. Carey, "Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestamps and Versions," IEEE Transactions on Software Engineering, vol. 13, no. 6, pp. 746-751, June 1987, doi:10.1109/TSE.1987.233479
Usage of this product signifies your acceptance of the Terms of Use.