Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems.

@article{DBLP:journals/tkde/Singhal91,
  author    = {Mukesh Singhal},
  title     = {Analysis of the Probability of Transaction Abort and Throughput
               of Two Timestamp Ordering Algorithms for Database Systems},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {3},
  number    = {2},
  year      = {1991},
  pages     = {261-266},
  ee        = {db/journals/tkde/Singhal91.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1991 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society 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/An3-2 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/aDVD2 or /dvd

References

[1]

Philip A. Bernstein, Nathan Goodman: Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems. VLDB 1980: 285-300 BibTeX

[2]

Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX

[3]

K. Mani Chandy, Ulrich Herzog, Lin S. Woo: Parametric Analysis of Queuing Networks. IBM Journal of Research and Development 19(1): 36-42(1975) BibTeX

[4]

A. Chesnais, Erol Gelenbe, Isi Mitrani: On the Modeling of Parallel Access to Shared Data. Commun. ACM 26(3): 196-202(1983) BibTeX

[5]

Daniel M. Dias, Balakrishna R. Iyer, John T. Robinson, Philip S. Yu: Design and Analysis of Integrated Concurrency-Coherence Controls. VLDB 1987: 463-471 BibTeX

[6]

...

[7]

...

[8]

...

[9]

...

[10]

Stephen S. Lavenberg: A Simple Analysis of Exclusive and Shared Lock Contention in a Database System. SIGMETRICS 1984: 143-148 BibTeX

[11]

Victor O. K. Li: Performance Models of Timestamp-Ordering Concurrency Control Algorithms in Distributed Databases. IEEE Trans. Computers 36(9): 1041-1051(1987) BibTeX

[12]

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

[13]

K. H. Pun, Geneva G. Belford: Performance Study of Two Phase Locking in Single-Site Database Systems. IEEE Trans. Software Eng. 13(12): 1311-1328(1987) BibTeX

[14]

Mukesh Singhal, Ashok K. Agrawala: Performance Analysis of an Algorithm for Concurrency Control in Replicated Database Systems. SIGMETRICS 1986: 159-169 BibTeX

[15]

Mukesh Singhal: Performance Analysis of the Basic Timestamp Ordering Algorithm via Markov Modeling. Perform. Eval. 12(1): 17-41(1991) BibTeX

[16]

...

[17]

...

[18]

Y. C. Tay, Nathan Goodman, Rajan Suri: Locking Performance in Centralized Databases. ACM Trans. Database Syst. 10(4): 415-462(1985) BibTeX

[19]

...

[20]

Alexander Thomasian: Performance Evaluation of Centralized Databases with Static Locking. IEEE Trans. Software Eng. 11(4): 346-355(1985) BibTeX

[21]

Alexander Thomasian, In Kyung Ryu: Analysis of Some Optimistic Concurrency Control Schemes Based on Certification. SIGMETRICS 1985: 192-203 BibTeX

[22]

Robert J. T. Morris, Wing Shing Wong: Performance Analysis of Locking and Optimistic Concurrency Control Algorithms. Perform. Eval. 5(2): 105-118(1985) BibTeX