Consider the following schedule:
|
T1 |
T2 |
T3 |
|
|
R(X) |
|
|
R(Y) |
|
|
|
|
|
R(Z) |
|
|
|
W(Z) |
|
|
W(Y) |
|
|
R(X) |
|
|
How many conflict serializable schedules are possible for the transactions given above?
1
5
2
3
3
6
4
4