DBMS | Transaction Management | CS GATE PYQs | GATE 2019 Solutions | Solutions Adda | Q30 | GATE2022

GATE 2019 Q: 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?

GATE Previous Year Questions with detailed explanation question by question

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT