This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs
November 1982 (vol. 8 no. 6)
pp. 558-562
A. Silberschatz, Department of Computer Sciences, University of Texas
This paper is concerned with the problem of ensuring the integrity of database systems that are accessed concurrently by a number of independent asychronously running transactions. It is assumed that the database system is partitioned into small units that are referred to as the database entities. The relation between the entities is represented by a directed acyclic graph in which the vertices correspond to the database entities and the arcs correspond to certain access rights. We develop a family of non-two-phase locking protocols for such systems that will be shown to ensure serializability and deadlock-freedom. This family is sufficientdy general to encompass all the previously developed non-two-phase lose locking protocols as well as a number of new protocols. One of these new protocols that seems to be particularly useful is also presented in this paper.
Index Terms:
transactions, Concurrency, consistency, database systems, deadlocks, locking protocols
Citation:
A. Silberschatz, Z.M. Kedam, "A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs," IEEE Transactions on Software Engineering, vol. 8, no. 6, pp. 558-562, Nov. 1982, doi:10.1109/TSE.1982.235885
Usage of this product signifies your acceptance of the Terms of Use.