Question

Which of the following concurrency control methods avoids deadlocks entirely but can reduce concurrency by blocking transactions at start?

A Two-phase locking (2PL) with deadlock detection
B Timestamps ordering protocol (e.g., Thomas’ write rule)
C Strict 2PL with wait-die/wound-wait
D Conservative (static) 2PL — acquire all locks before execution
E Optimistic concurrency control with validation
Practice Next

Hey! Ask a query