2PL Preserves Transaction Handshakes (cont’d)
Stating this more formally …
Theorem: For any 2PL execution H, there is an equivalent serial execution Hs, such that for all Ti, Tk, if Ti committed before Tk started in H, then Ti precedes Tk in Hs.
Previous slide
Next slide
Back to first slide
View graphic version