Strictness and serializability

  • Udo Kelter
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)


In the theory of concurrency control several notions of the correctness of logs have been developed, particularly final-state-, view-, and conflict-preserving-serializability. SR, VSR, and CPSR are the respective sets of logs. In each case a strict variant can be defined. The respective sets are SSR, SVSR, and SCPSR. While SSR has already been investigated, this is not the case for SVSR and SCPSR. In this paper we will show the following:
  • —SCPSR = W2PL, W2PL being the class of weakly two-phase locked logs.

  • —Implications between the notions of correctness (or inclusions of sets) are as follows (A → B reads as A \(\subseteq\)B):

The labels indicate conditions when the inclusions hold; the abbreviations used are (& = and, ¦ = or):

D : dead values do not occur

W : every transaction reads an object before writing it

R : read-only transactions do not occur

None of these conditions can be dropped; this contradicts two claims made in the relevant literature ([P79], [BSW79]).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BHR80]
    Bayer, R.; Heller, H.; Reiser, A.: Parallelism and recovery in database systems; ACM-TDS 5:2, p.139–156; 1980/06Google Scholar
  2. [BSW79]
    Bernstein, P.A.; Shipman, D.W.; Wong, W.S.: Formal aspects of serializability in database concurrency control; IEEE-TSE SE-5:3, p.203–216; 1979/05Google Scholar
  3. [C81]
    Casanova, M.A.: The concurrency control problem for database systems; Springer, LNiCS 116, 175p; 1981Google Scholar
  4. [K85]
    Kelter, U.: Parallele Transaktionen in Datenbanksystemen; B.I. Wissenschaftsverlag, Reihe Informatik/51, 201p; 1985/08Google Scholar
  5. [P79]
    Papadimitriou, C.H.: The serializability of concurrent database updates; JACM 26:4, p.631–653; 1979/10CrossRefGoogle Scholar
  6. [S82]
    Sethi, R.: Useless actions make a difference: strict serializability of database updates; JACM 29:2, p.394–403; 1982/04Google Scholar
  7. [Y84]
    Yannakakis, M.: Serializability by locking; JACM 31:2, p.227–244; 1984/04CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Udo Kelter
    • 1
  1. 1.Universität DortmundDortmund 50W. Germany

Personalised recommendations