RECOVERABLE SCHEDULE$:-$ A recoverable schedule is one where, for each pair
of Transaction $T_{i}$ and $T_{j}$ such that if $T_{j}$ reads data item previously written by $ T_{i},$ then the commit operation of $T_{i}$ appears before
the commit operation $T_{j}.$
$T_{1}$ |
$T_{2}$ |
R(a) |
|
W(a) |
|
|
R(a) |
|
Commit |
Commit |
|
So this schedule is not
recoverable.