Locking Protocols: From Exclusive to Shared 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. First, a general result concerning extensions of all protocols that employ EXCLUSIVE locks only to also employ SHARED locks is presented. Then a famdy of protocols apphcable to database systems that are modeled by directed acydtc graphs Is presented.

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

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

[3]  Abraham Silberschatz,et al.  Controlling concurrency using locking protocols , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

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

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

[7]  Abraham Silberschatz,et al.  A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs , 1982, IEEE Transactions on Software Engineering.

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