Conflict Serializability & Graphs
Theorem: A schedule is conflict serializable iff its precedence graph is acyclic.
Theorem: 2PL ensures that the precedence graph will be acyclic!
Strict 2PL improves on this by avoiding cascading aborts, problems with undoing WW conflicts.