GATE CS 2019 — Question 35

Multiple choice 1 mark Question 35 2019

Question 35

MCQ 1 marks · −0.33 Databases

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?

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2019 Databases

Source: GATE 2019 Computer Science and Information Technology (question number approximate)

All Databases questions