Q11

MCQ1 mark, −0.33

Consider the following two statements about database transaction schedules: Which of the above statements is/are TRUE? I only II only Both I and II Neither I nor II

(A)

Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.

(B)

Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable

Loading…