PREDICT SERIALIZABILITY OF GIVEN SCHEDULE

Question

T1	T2
READ-Q
	WRITE-P
	WRITE-Q
READ-P

Given schedule is:

a) Not conflct serializable, but view serializable

b)  conflct serializable, not view serializable

c) Both conflct serializable, and view serializable

d) Not conflct serializable, not view serializable

Comments

Option D???

---

Option D seems right.. Definitely not conflict serializable as it has cyclic dependency. Also not view serializable as the first read and last write sequence graph also has cycle.. Not sure though... I always get confused with View serializability concept.

Answer 1

u all know abot conflict serializability , now i m explaining only about view , since t1 reading q from database then it must then t1---->t2 and also by last write operation by t2 on q so t1---->t2

now come for variable p since t1 is reading from t2 then t2------>t1 , if we combine all then they form cycle so it is also not view serializable