ACM SIGMOD Anthology TODS dblp.uni-trier.de

Deadlock Freedom Using Edge Locks.

Henry F. Korth: Deadlock Freedom Using Edge Locks. ACM Trans. Database Syst. 7(4): 632-652(1982)
@article{DBLP:journals/tods/Korth82,
  author    = {Henry F. Korth},
  title     = {Deadlock Freedom Using Edge Locks},
  journal   = {ACM Trans. Database Syst.},
  volume    = {7},
  number    = {4},
  year      = {1982},
  pages     = {632-652},
  ee        = {http://doi.acm.org/10.1145/319758.319772, db/journals/tods/Korth82.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

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.

Copyright © 1982 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX
[2]
...
[3]
Zvi M. Kedem, Abraham Silberschatz: A Characterization of Database Graphs Admitting a Simple Locking Protocol. Acta Inf. 16: 1-13(1981) BibTeX
[4]
Abraham Silberschatz, Zvi M. Kedem: A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs. IEEE Trans. Software Eng. 8(6): 558-562(1982) BibTeX
[5]
...
[6]
Henry F. Korth: A Deadlock-Free, Variable Granularity Locking Protocol. Berkeley Workshop 1981: 105-121 BibTeX
[7]
...
[8]
Henry F. Korth: Locking Primitives in a Database System. J. ACM 30(1): 55-79(1983) BibTeX
[9]
...
[10]
Abraham Silberschatz, Zvi M. Kedem: Consistency in Hierarchical Database Systems. J. ACM 27(1): 72-80(1980) BibTeX
[11]
Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX

Referenced by

  1. Suh-Yin Lee, Ruey-Long Liou: A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems. IEEE Trans. Knowl. Data Eng. 8(1): 144-156(1996)
  2. Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Nested Transactions and Read/Write Locking. PODS 1987: 97-111
  3. Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
    Contents
  4. Michael J. Carey, Michael Stonebraker: The Performance of Concurrency Control Algorithms for Database Management Systems. VLDB 1984: 107-118
  5. Gael N. Buckley, Abraham Silberschatz: Concurrency Control in Graph Protocols by Using Edge Locks. PODS 1984: 45-50
  6. Michael J. Carey: Granularity Hierarchies in Concurrency Control. PODS 1983: 156-165
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:50 2008