Consider the following transaction schedule, where time increases from top to bottom. T 1 T 2 T
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider the following transaction schedule, where time increases from top to bottom.
T1 | T2 | T3 | T4 |
Read (X) | |||
Read(Y) | |||
Read(Z) | |||
Read(Y) | |||
Write(Y) | |||
Write(Z) | |||
Read(U) | |||
Read(Y) | |||
Write(Y) | |||
Read(Z) | |||
Write(Z) | |||
Read(U) | |||
Write(U) |
Answer the following questions:
- Draw the precedence graph of the above schedule.
- Is this schedule conflict serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain why.
- Is this schedule view serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain your answer.
Related Book For
Posted Date: