Consider the schedule S = r1(x), w2(x), r1(y), w3(y), c3, c2, c1. Which of the following is the minimal conflict-equivalent serial order and does it avoid cascading aborts?
Correct: N/A
The conflicting operations are w2(x) → r1(x) (T2→T1) and w3(y) → r1(y) (T3→T1). The topological sort gives T2→T3→T1. Because T2 commits before T1 reads x and T3 commits before T1 reads y, no transaction reads uncommitted data, so the schedule avoids cascading aborts.