Schedule S is R1(A), W1(A), R2(A), W2(A), R1(B), W1(B), R2(B), W2(B). Which serial schedule is S conflict-equivalent to?
Correct answer D. T1 then T2
Explanation
On A, all of T1's operations come before T2's conflicting operations, giving the edge T1 -> T2. On B the same pattern repeats, again T1 -> T2. There is no edge from T2 to T1, so the graph is acyclic, and a topological sort gives the serial order T1, T2. Although the transactions interleave, every conflict is resolved in T1's favour.
Answer checked How we write and check questions
Discussion