论文信息 - Deadlock freedom using edge locks

Deadlock freedom using edge locks

We define a series of locking protocols for database systems that all have three main features: freedom from deadlock, multiple granularity, and support for general collections of locking primitives. A rooted directed acyclic graph is used to represent multiple granularities, as in System R. Deadlock freedom is guaranteed by extending the System R protocol to require locks on edges of the graph in addition to the locks required on nodes.

Henry F. Korth

[1] Henry F. Korth. A Deadlock-Free, Variable Granularity Locking Protocol , 1981, Berkeley Workshop.

[2] Henry F. Korth,et al. Locking Primitives in a Database System , 1983, JACM.

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

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

[5] Henry F. Korth. Locking protocols: general lock classes and deadlock freedom , 1981 .

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

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

[8] Irving L. Traiger,et al. Granularity of Locks and Degrees of Consistency in a Shared Data Base , 1998, IFIP Working Conference on Modelling in Data Base Management Systems.