Draw the serializable graphs for the schedule S1 and S2 and state whether each schedule is (i)conflict serializable or not (ii)view serializable or not. If a schedule is conflict/view serializable , write down equivalent serial schedule(s) S1:r1(X);r2(Z);r1(Z);r3(X);r3(Y);w1(X);w3(Y);r2(Y);w2(Z);w2(Y); S2:r1(X);r2(Z);r3(X);r1(Z);r2(Y);r3(Y);w1(X);w2(Z);w3(Y);w2(Y);

Serializability in DBMS

• Serializability helps to identify which non-serial schedules are correct and will maintain the consistency of the database.

• Serializable Schedules - If a given non-serial schedule of ‘n’ transactions is equivalent to some serial schedule of ‘n’ transactions, then it is called a Serializable Schedule.

• There are two …