Non-Two-Phase Locking Protocols with Shared and Exclusive Locks

This paper is concerned with the problem of developing a family of locking protocols which employ both SHARED and EXCLUSIVE locks and which ensure the consistency of database systems that are accessed concurrently by a number of asynchronously running transactions. The protocols in the family are not two-phase. They are applicable to database systems which are hierarchically organized as well as database systems which are modeled by directed acyclic graphs. A comparison with other previously published protocols is also presented.

[1]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[2]  Philip A. Bernstein,et al.  Formal Aspects of Serializability in Database Concurrency Control , 1979, IEEE Transactions on Software Engineering.

[3]  Daniel J. Rosenkrantz,et al.  Concurrency control for database systems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[4]  Abraham Silberschatz,et al.  Consistency in Hierarchical Database Systems , 1980, JACM.

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

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

[7]  C. J. Date Locking And Recovery In A Shared Database System: An Application Programming Tutorial , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[8]  Abraham Silberschatz,et al.  Controlling Concurrency Using Locking Protocols (Preliminary Report) , 1979, FOCS 1979.

[9]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[10]  Daniel J. Rosenkrantz,et al.  System level concurrency control for distributed database systems , 1978, TODS.

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