engineering recuitment NIC NIELIT Scientist B 2023 Mock Test DBMS Transaction Serializability of Schedules
Consider the following database schedule with three transactions, T1, T2, and T3.
S = r1(X) r2(Y) r3(Y) w2(Y) w1(X) w3(X) r2(X) w2(X);
where ri(X) and ri(Y) denotes a read operation on data items X and Y respectively and wi(X) and wi(Y) denotes a write operation on data items X and Y respectively by transaction Ti.1
S is serializable as T1 → T2 → T3
2
S is serializable as T1 → T3 → T2
3
S is serializable as T2 → T1 → T3
4
The schedule is not serializable