The Overhead of Locking (and Commit) Protocols in Distributed Databases.

Ouri Wolfson: The Overhead of Locking (and Commit) Protocols in Distributed Databases. ACM Trans. Database Syst. 12(3): 453-471(1987)

@article{DBLP:journals/tods/Wolfson87,
  author    = {Ouri Wolfson},
  title     = {The Overhead of Locking (and Commit) Protocols in Distributed
               Databases},
  journal   = {ACM Trans. Database Syst.},
  volume    = {12},
  number    = {3},
  year      = {1987},
  pages     = {453-471},
  ee        = {http://doi.acm.org/10.1145/27629.28053, db/journals/tods/Wolfson87.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Abstract

The main purpose of a locking protocol is to ensure correct interleaving of actions executed by concurrent transactions. The locking protocol consists of a set of rules dictating how accessed entities should be locked and unlocked. As a result of obeying the rules, transactions in a distributed database incur an overhead. We propose three measures of evaluating this overhead, each most suitable to a different type of underlying communication network. Then, using a graph theoretic model, we analyze and compare three protocols according to each measure: two-phase locking, two-phase locking with a fixed order imposed on the database entities (ensuring deadlock freedom), and the tree protocol. In practice, a transaction also executes the two-phase commit protocol in order to guarantee atomicity. Therefore, the combined overhead of each locking protocol and the two-phase commit protocol is also determined.

Copyright © 1987 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 ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/An3-1 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD2 or /dvd

BibTeX

References

[1]: Rakesh Agrawal, Michael J. Carey, Miron Livny: Models for Studying Concurrency Control Performance: Alternatives and Implications. SIGMOD Conference 1985: 108-121 BibTeX
[2]: Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX
[3]: ...
[4]: Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX
[5]: Stefano Ceri, Giuseppe Pelagatti: Distributed Databases: Principles and Systems. McGraw-Hill Book Company 1984, ISBN 0-07-010829-3
BibTeX
[6]: Cynthia Dwork, Dale Skeen: The Inherent Cost of Nonblocking Commitment. PODC 1983: 1-11 BibTeX
[7]: Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) BibTeX
[8]: Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX
[9]: ...
[10]: Paris C. Kanellakis, Christos H. Papadimitriou: The Complexity of Distributed Concurrency Control. FOCS 1981: 185-197 BibTeX
[11]: Paris C. Kanellakis, Christos H. Papadimitriou: Is Distributed Locking Harder? J. Comput. Syst. Sci. 28(1): 103-120(1984) BibTeX
[12]: ...
[13]: Abraham Silberschatz: A Case for Non-Two-Phase Locking Protocols that Ensure Atomicity. IEEE Trans. Software Eng. 9(4): 535-538(1983) BibTeX
[14]: Abraham Silberschatz, Zvi M. Kedem: Consistency in Hierarchical Database Systems. J. ACM 27(1): 72-80(1980) BibTeX
[15]: Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX
[16]: Ouri Wolfson, Mihalis Yannakakis: Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. PODS 1985: 105-112 BibTeX

Referenced by

Sang Hyuk Son, Navid Haghighi: Performance Evaluation of Multiversion Database Systems. ICDE 1990: 129-136
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents

BibTeX

ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]