ACE-Database

Question

Comments

T1	T2	T3
R(X)
	W(X)
	W(Y)
		W(Y)
W(Y)
C1
	C2
		C3

Draw precedence graph.

There is a loop in the graph.Hence it is not conflic serializable.

but It is view serializable.

---

It tells that it is not conflict serializable, but what about view serializability.

---

i forgot about view serializable,sorry.

it is view serializable.

Answer 1

The answer must be A.

The scheduleis not conflict serializable because there is cycle in between (T1 and T2)  and ( T1 T2 T3 ).

The schedule is view serializable and not conflict serializable when there s atleaet one blind write.

and transaction2 has 2 blind writes.