This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analyzing Concurrency Control Algorithms When User and System Operations Differ
May 1983 (vol. 9 no. 3)
pp. 233-239
P.A. Bernstein, Aiken Computation Laboratory, Harvard University
Concurrency control algorithms for database systems are usually regarded as methods for synchronizing Read and Write operations. Such methods are judged to be correct if they only produce serializable executions. However, Reads and Writes are sometimes inaccurate models of the operations executed by a database system. In such cases, serializability does not capture all aspects of concurrency control executions. To capture these aspects, we describe a proof schema for analyzing concurrency control correctness. We illustrate the proof schema by presenting two new concurrency algorithms for distributed database systems.
Index Terms:
transactions, Database systems, nested transactions, serializability theory
Citation:
P.A. Bernstein, N. Goodman, null Ming-Yee Lai, "Analyzing Concurrency Control Algorithms When User and System Operations Differ," IEEE Transactions on Software Engineering, vol. 9, no. 3, pp. 233-239, May 1983, doi:10.1109/TSE.1983.236732
Usage of this product signifies your acceptance of the Terms of Use.