DBA

database management system

Consider the three transactions T1, T2, and T3, and schedule Slgiven below. Draw the serializability (precedence) graphs for S1, and state whether the schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule. T1: rl (X); rl (Z); wl (X); T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y); T3: r3 (X); r3 (Y); w3 (Y); S1: r1 (X); r2 (Z); rl (Z); r3 (X); r3 (Y); wl (X); w3 (Y); r2 (Y); w2 X; ; ); Y); (Z); w2 (Y)