Question
Question 8: Serializable Schedules . . . . . . . . . . . . . . . . . . . . .
Question 8: Serializable Schedules . . . . . . . . . . . . . . . . . . . . . . . . . . . . [10 points] Consider the following set of transactions accessing data elements X, Y, and Z. Figure 3 shows an interleaved execution schedule for transactions T1, T2, and T3. time T1 T2 T3 1 READ(X) 2 WRITE(Y) 3 READ(X) 4 WRITE(X) 5 WRITE(Z) 6 READ(X) 7 WRITE(Z) 8 WRITE(Y) 9 WRITE(Y) Figure 3: An interleaved schedule (a) [2 points] Give the dependency graph for the schedule in Figure 3. (b) [1 point] 2 Y 2 N Is the schedule conflict-serializable? (c) [3 points] If yes, give an equivalent serial execution; if not, explain briefly. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (d) [1 point] 2 Y 2 N Is the schedule view-serializable? (e) [3 points] If yes, give an equivalent serial execution; if not, explain briefly. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Question 8: Serializable Schedules [10 points ] Consider the following set of transactions accessing data elements X, Y, and Z. Figure 3 shows an interleaved execution schedule for transactions T1,T2, and T3. Figure 3: An interleaved schedule (a) [2 points] Give the dependency graph for the schedule in Figure 3. (b) [1 point ]YN Is the schedule conflict-serializable? (c) [3 points] If 'yes', give an equivalent serial execution; if not, explain briefly. (d) [1 point ]YN Is the schedule view-serializable? (e) [3 points] If 'yes', give an equivalent serial execution; if not, explain brieflyStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started