GATE | GATE CS 2019 | Question 18

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?
(A) I only
(B) II only
(C) Both I and II
(D) Neither I nor II

Answer: (C)

Explanation: Following Strict 2-PL ensures that our schedule is: serializablity, Recoverable, and Cascadeless. So statement (I) is true.

Thomas Write Rule for concurrency control does not enforce Conflict Serializablity, so statement (II) is also true.

Option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.