1,378 views
2 votes
2 votes

2 Answers

1 votes
1 votes
Answer is D .

Draw precedence graph there is a cycle so it is not serializable .

There is no dirty read here so it is better to go for D
0 votes
0 votes
Ans is D.

1) cycle present . T1 to T2(R1x->W2x), and T2 to T1(W2y->W1y) so not conflict serializable

2)Since T2 writes Y first followed by T3 and T1 hence the schedule to be recoverable T2 must commit first followed by T3 and T1. but here T1 commits first then T2 and T3. So schedule not recoverable. Here as T1 commits before T2 , suppose before T2 commits,T2 fails, then as per atomicity property of DBMS T2 will rollback but since T1 committed already and T1 can not rollback (durability property), but T1 has modified a common data object i.e, y ,but as T2 rollbacks all changes on the data objects are undone and hence updates of T1 is lost and unrecoverable.

3)here is blind write T2 to T3 and T2 to T1 and T3 to T1. So schedule may be view serializable. so checking initial read , done by T1. No updated read in between, final read is done by T1 too. now same transaction initial and final read is not possible in serial sequence. so schedule is not view serializable.

Hence Schedule is not serializable.

Related questions

0 votes
0 votes
1 answer
2
Kaustubh _15 asked Dec 15, 2017
469 views
The above question has a blind write so it should be View Serializable. But can it be Conflict Serializable?
2 votes
2 votes
1 answer
3
aditi19 asked Nov 18, 2018
2,205 views
T1T2T3R(X)W(X)commitW(X)commitR(X)commit is this transaction conflict serializable and view serializable?
0 votes
0 votes
1 answer
4
aditi19 asked Nov 18, 2018
598 views
T1 T2 T3W(Y)commitR(X)R(Y)W(Z)commitW(X)commitis this schedule a strict schedule?