Database Systems

Question 1: For each of the following schedules, draw the serlializability graph (also known as precedence graph or conflict graph) and determine whether the schedule is conflict T1 R (X) T2 T3 R (Y) W (X) R (X) R (Y) 1.2) T1 R (X) R (Y) W (X) T2 T3 R (Y) W (Y) W (X) R (Y) Question 2: 2.1) Explain the difference between "deadlock prevention" and "deadlock detection and recovery". 2.2) Explain the difference between "Wait/Die" and "Wound/Wait" techniques for deadlock prevention