Advertisement

Comparison of algorithms controlling concurrent access to a database: A combinatorial approach

  • D. Arques
  • J. Françon
  • M. T. Guichet
  • P. Guichet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)

Abstract

In this paper we compare the performances of concurrency control algorithms using the combinatorics of words. We characterize such control algorithms by a triple of values, respectively estimating the frequency of accepted executions of concurrent transactions, the degree of authorized parallelism, and the load factor (a value related to the average number of elementary operations needed for the serialization of an execution). We compute these values for timestamp ordering and two phases locking in the case of the concurrent execution of two transactions. We obtain the exact and asymptotic frequences of deadlocked executions of two transactions, and compare these two algorithms in various asymptotic situations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bernstein P.A., Goodman N., Concurrency Control in Distributed Data-bases System, Computing Surveys, Vol 13, no 2, June 81, pp. 185–221.Google Scholar
  2. [2]
    Comtet L., Analyse Combinatoire, Tome II, Collection Sup, PUF, 1970.Google Scholar
  3. [3]
    Cori R. et Perrin D., Sur la reconnaissabilité dans les monoïdes partiellement commutatifs libres, Rapport Univ. Bordeaux I, 1984.Google Scholar
  4. [4]
    Flé M.P., Roucairol G., Maximal Serializability of Iterated Transactions, TCS, vol 38, 1985, pp 1–16.Google Scholar
  5. [5]
    Franaszek P., Robinson J.T., Limitation of Concurrency in Transaction Processing, ACM TODS, Vol 10, no 1, March 85, pp 1–28.Google Scholar
  6. [6]
    Françon J., Sérialisabilité, commutation, mélange et tableaux de Young, Rapport de recherche UHA no 27, 1985, submitted to publication.Google Scholar
  7. [7]
    Françon J., Une approche quantitative de l'exclusion mutuelle, to appear in R.A.I.R.O.Google Scholar
  8. [8]
    Gardarin G., Bases de données, les Systèmes et leurs Langages, Eyrolles, 1983.Google Scholar
  9. [9]
    Madelaine J., Performance Evaluation of Concurrency Control Algorithms in the SABRE database Computer, Database Machine, in Workshop MUNICH 83, ed Leilich-Missikof, Springer Verlag, pp 277–292.Google Scholar
  10. [10]
    Mitra D., Weinberger P.J., Probabilistic Models of Database Locking Solution, Computational Algorithms and Asymptotics, JACM, Vol 31, no 4, October 84, pp 855–878.Google Scholar
  11. [11]
    Papadimitriou C.H., Serializability of Concurrent Updates, JACM, vol 26, no 4, October 79, pp 631–653.Google Scholar
  12. [12]
    Papadimitriou C.H., A. Theorem in Database Concurrency Control, JACM, Vol 29, No 4, October 82, pp 998–1006.Google Scholar
  13. [13]
    Papadimitriou C.H., Concurrency Control by Locking, SIAM Journal on Computing, Vol 12, no 2, May 1983, pp 215–226.Google Scholar
  14. [14]
    Sevcik K.C., Comparison of Concurrency Control Methods using Analytic Models, Information Processing 1983, REA Mason (ed).Google Scholar
  15. [15]
    Thomasian A., Performance Evaluation of Centralized Databases with Static Locking, IEEE Trans. on Software Engineering, Vol. 11, no 4, April 1985, pp 346–355.Google Scholar
  16. [16]
    Ullman J.C., Principles of Databases Systems, 2nd Edition, Pitman, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • D. Arques
    • 1
  • J. Françon
    • 1
  • M. T. Guichet
    • 1
  • P. Guichet
    • 1
  1. 1.I.S.E.A. Université de Haute AlsaceMulhouseFrance

Personalised recommendations