Strictness and serializability
—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.
- [BHR80]Bayer, R.; Heller, H.; Reiser, A.: Parallelism and recovery in database systems; ACM-TDS 5:2, p.139–156; 1980/06Google Scholar
- [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
- [C81]Casanova, M.A.: The concurrency control problem for database systems; Springer, LNiCS 116, 175p; 1981Google Scholar
- [K85]Kelter, U.: Parallele Transaktionen in Datenbanksystemen; B.I. Wissenschaftsverlag, Reihe Informatik/51, 201p; 1985/08Google Scholar
- [S82]Sethi, R.: Useless actions make a difference: strict serializability of database updates; JACM 29:2, p.394–403; 1982/04Google Scholar