GATE CSE 2019 | Question: 11

Question

Consider the following two statements about database transaction schedules:

1. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
2. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable

Which of the above statements is/are TRUE?

• A. I only
• B. II only
• C. Both I and II
• D. Neither I nor II

Answer 1

Dirty reads are not present in both strict and rigrous 2PL locking hence they are recoverable. Also in thomas write rule, the transactions will give view serializable minus conflict relation.