Consider a schedule of transactions and (columns are time slots, left to right):
Here, stands for "Read(X)" and stands for "Write(X)". Which one of the following schedules is conflict equivalent to the above schedule?
Tap to open full sizeFigure description
The given schedule has two rows, T1 and T2, with time running left to right. T1: RA, then RC, then WD, then WB, then Commit. T2: RB, WB, RD, WC, then Commit at the far right. Interleaved order: RA(T1), RB(T2), WB(T2), RC(T1), RD(T2), WD(T1), WC(T2), WB(T1), Commit(T1), Commit(T2). Each option is a similar two-row table of slots.
- (A)
Figure — T2 runs RB, WB, RD first (T1 empty). Then T1 runs RA, RC, WD, WB while T2 is idle. Then T2 runs WC, then T1 Commit, then T2 Commit.
- (B)
Figure — T1 runs RA, RC, WD, WB first (T2 idle). Then T2 runs RB, WB, RD, WC. Then T1 Commit, then T2 Commit.
- (C)
Figure — T1 runs RA, RC, WD, then T2 runs RB, WB, RD, then T1 runs WB, then T2 runs WC, then T1 Commit, then T2 Commit.
- (D)
Figure — T2 runs RB, WB, RD, WC first (T1 idle). Then T1 runs RA, RC, WD, WB, Commit, then T2 Commit.