Two-Phase Locking (cont)
Theorem: If S is any schedule of two-phase transactions, then S is serializable.
Proof:
Suppose not. Then the serialization graph G for S has a
cycle,
Ti1 -> Ti2 -> … -> Tip -> Ti1
Therefore, a lock by Ti1 follows an unlock by Ti1,
contradicting the assumption that Ti1 is two-phase.