论文信息 - The Optimal Locking Problem in a Directed Acyclic Graph

The Optimal Locking Problem in a Directed Acyclic Graph

Abstract : We assume a multiple granularity database locking scheme similar to that of Gray, et al. in which a rooted directed acyclic graph is used to represent the levels of granularity. We prove that even if it is known in advance exactly what database references the transaction will make, it is NP-complete to find the optimal locking strategy for the transaction.

Henry F. Korth

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

[2] 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.

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

[4] Jim Gray,et al. A Transaction Model , 1980, ICALP.

[5] Brian Randell,et al. Operating Systems, An Advanced Course , 1978 .

[6] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .

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

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .