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:

1. Draw the precedence graph of the above schedule.
2. Is this schedule conflict serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain why.
3. Is this schedule view serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain your answer.

Answer rating: 100% (QA)

h Tz P Precedente grep hi T3 s0 Since ther... View the full answer