Question: **this is a Databases question** Consider these schedules involving 3 transactions: S1: r1(x); r2(y); r1(z); r3(z); r2(x); r1(y) S2: r1(x); w2(y); r1(z); r3(z); w2(x); r1(y)
**this is a Databases question**
Consider these schedules involving 3 transactions:
S1: r1(x); r2(y); r1(z); r3(z); r2(x); r1(y) S2: r1(x); w2(y); r1(z); r3(z); w2(x); r1(y) S3: r1(x); w2(y); r1(z); r3(z); w1(x); r2(y) S4: r1(x); r2(y); r1(z); r3(z); w1(x); w2(y)
For each schedule, draw the precedence graph and decide if the schedule is conflict-serializable.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
