Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. 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?

Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. 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? Correct Answer Both I and II

Strict 2PL allows only schedules whose precedence graph is acyclic i.e. schedule is Conflict Serial.

In 2PL, transactions do not release exclusive locks until the transaction has committed or aborted i.e. schedule is recoverable.

Time stamp ordering schedule with Thomas write rule generate View serial schedule with BLIND WRITE. Because of BLIND WRITE it won't be Conflict Serial.

Option 3 is correct.

Related Questions

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?