A Quantitative Comparison of Lockprotocols for Centralized Databases.

@inproceedings{DBLP:conf/vldb/KiesslingL83,
  author    = {Werner Kie{\ss}ling and
               G. Landherr},
  editor    = {Mario Schkolnick and
               Costantino Thanos},
  title     = {A Quantitative Comparison of Lockprotocols for Centralized Databases},
  booktitle = {9th International Conference on Very Large Data Bases, October
               31 - November 2, 1983, Florence, Italy, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1983},
  isbn      = {0-934613-15-X},
  pages     = {120-130},
  ee        = {db/conf/vldb/KiesslingL83.html},
  crossref  = {DBLP:conf/vldb/83},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

To process transactions of several users concurrently and consistently in a shared database various lockprotocols have been developed recently. Though the need for a quantitative analysis of lockprotocols is rather obvious, this work has not yet been fully performed for centralized database systems. As database applications in the near future tend to have very high transaction rates, such quantitative investigation on the quality of lockprotocols will become increasingly valuable.

The paper evaluates three well-know lockprotocols by discrete-event simulation. We represent and discuss the results which we have gained in the simulation runs.

Copyright © 1983 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

• Download PDF file (www.vldb.org, Darmstadt, Germany)
• Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

• 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/vldb7588 or /cdrom

• 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/aDVD1 or /dvd

Printed Edition

References

[BAD 80]

Dushan Z. Badal: The Analysis of the Effects of Concurrency Control on Distributed Database System Performance. VLDB 1980: 376-383

[BAY 76]

...

[BEHR 82]

Rudolf Bayer, Klaus Elhardt, Johannes Heigert, Angelika Reiser: Dynamic Timestamp Allocation for Transactions in Database Systems. DDB 1982: 9-20

[BHR 80]

Rudolf Bayer, Hans Heller, Angelika Reiser: Parallelism and Recovery in Database Systems. ACM Trans. Database Syst. 5(2): 139-156(1980)

[BRY 80]

...

[EGLT 76]

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)

[GLPT 76]

...

[GRA 80]

Jim Gray: A Transaction Model. ICALP 1980: 282-298

[KR 79]

H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. VLDB 1979: 351

[LAN 82]

...

[MN 82]

Daniel A. Menascé, Tatuo Nakanishi: Optimistic versus pessimistic concurrency control mechanisms in database management systems. Inf. Syst. 7(1): 13-27(1982)

[PL 80]

Dominique Potier, Ph. Leblanc: Analysis of Locking Policies in Database Management Systems. Commun. ACM 23(10): 584-593(1980)

[RS 79]

Daniel R. Ries, Michael Stonebraker: Locking Granularity Revisited. ACM Trans. Database Syst. 4(2): 210-227(1979)

[RSL 78]

Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: System Level Concurrency Control for Distributed Database Systems. ACM Trans. Database Syst. 3(2): 178-198(1978)