论文信息 - A theorem in database concurrency control

A theorem in database concurrency control

Consider two straight-line programs a and b, and let h be a set of sequences of steps of a and b, possibly interleaved, but each containing all steps of a and b in the right order. A necessary and sufficient condition is given for h to be realisable as the set of all sequences of steps which are legal under some insertion of lock-unlock steps between the steps of a and b. 13 references.

Christos H. Papadimitriou

[1] Christos H. Papadimitriou,et al. Concurrency Control by Locking , 1983, SIAM J. Comput..

[2] C. A. R. Hoare,et al. Monitors: an operating system structuring concept , 1974, CACM.

[3] Christos H. Papadimitriou. On the power of locking , 1981, SIGMOD '81.

[4] Mihalis Yannakakis. Issues of correctness in database concurrency control by locking , 1981, STOC '81.

[5] H. T. Kung,et al. An optimality theory of concurrency control for databases , 1979, SIGMOD '79.

[6] J. D. Uiiman,et al. Principles of Database Systems , 2004, PODS 2004.

[7] C. H. Papadimitriou. SERIALIZABILITY OF CONCURRENT DATA BASE UPDATES , 1979 .

[8] Mihalis Yannakakis,et al. Locking policies: Safety and freedom from deadlock , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9] Christos H. Papadimitriou,et al. The serializability of concurrent database updates , 1979, JACM.

[10] Leslie Lamport. Towards a theory of correctness of multi-user database systems , 1976 .

[11] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.

[12] Eugene W. Stark. Semaphore primitives and starvation-free mutual exclusion , 1982, JACM.