Consider the following schedule for transactions T1 and T2, T3
|
T1 |
T2 |
T3 |
|
R(I) |
||
|
R(K) |
||
|
W(I) |
||
|
W(I) |
||
|
W(J) |
||
|
W(K) |
||
|
R(I) |
||
|
R(J) |
||
|
W(I) |
||
|
W(J) |
Which one if the following schedules below is the correct conflict serialization of the above?
1
T1 → T3 → T2
2
T2 → T3 → T1
3
T1 → T2 → T3
4
None of the above