Self Doubt

Question

Is the following schedule conflict serializable

T1	T2	T3
W(X)
commit
	R(X)
	W(X)
		R(X)
		W(X)
		commit
	W(X)
	commit

 

Comments

Because no cycle 

---

Correct me if I am wrong. 

@Shaik Masthan

@Mk Utkarsh

the schedule is not C.S as  we have a cycle in it(T2 , T3).. Commits dont' matter.

only aborts do as we don't count them while makeing dependency graph. 

---

@Shaik Masthan

For that gate 2014 questions ..the schedule is serializable because no cycle in graph ..its so happened coincidently that if we consider commit or not ..in both cases no cycle for that question ...diagram given by @Mk Utkarsh

is correct i think ..

 

Answer 1

Serializable but not recoverable..