Talk:Example: Strict 2PL/@comment-31.187.52.88-20150103131744

2PL variants:

Conservative: Prevents deadlock by locking all desired data items before transaction begins execution by predeclaring its read_set and write_set.

Basic: Transaction locks data items incrementally. This may cause deadlock which is dealt with.

Strict: This is the most commonly used two-phase locking algorithm. The locks are acquired in the growing phase and released int the shrinking phase. A transaction T does not release any of its exclusive (write) locks until after it commits or aborts. Hence, no other transaction can read or write an item that is written by T unless T has committed.

Rigorous: More restrictive than Strict. A transaction does not release any of its locks (exclusive or shared) until after it commits or aborts.