The Community for Technology Leaders
Green Image
Issue No. 03 - May (1983 vol. 9)
ISSN: 0098-5589
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.
transactions, Database systems, nested transactions, serializability theory

P. Bernstein, N. Goodman and n. Ming-Yee Lai, "Analyzing Concurrency Control Algorithms When User and System Operations Differ," in IEEE Transactions on Software Engineering, vol. 9, no. , pp. 233-239, 1983.
93 ms
(Ver 3.3 (11022016))