Computer Science And Engineering

Computer Science And EngineeringDatabase Management System (DBMS)Multiple Select (MSQ)2 Marks
Q8.

Consider the following read-write schedule SS over three transactions T1T_1, T2T_2, and T3T_3, where the subscripts in the schedule indicate transaction IDs:

S:r1(z);w1(z);r2(x);r3(y);w3(y);r2(y);w2(x);w2(y);S: r_1(z); w_1(z); r_2(x); r_3(y); w_3(y); r_2(y); w_2(x); w_2(y);

Which of the following transaction schedules is/are conflict equivalent to SS ?

A
T1T2T3T_1T_2T_3
B
T1T3T2T_1T_3T_2
C
T3T2T1T_3T_2T_1
D
T3T1T2T_3T_1T_2
PREV NODE