971 views

1 Answer

Best answer
3 votes
3 votes

Well, clearly all the transactions are reading the initial value of A, so w.r.t. READing any transaction can come to first position

BUT

the last Write on B is from T4, so Tmust be last.

This gives (any combination of T1 T2 T3)  $\rightarrow$  T4 .

selected by

Related questions

1 votes
1 votes
1 answer
1
Na462 asked Jan 13, 2019
1,479 views
Consider following Schedule S with data item x :S : W1(X) R2(X) W3(X) R4(X) W5(X) R6(X) W7(X) R8(X) W9(X) R10(X)The number of schedule view equivalent to Schedule S but n...
1 votes
1 votes
1 answer
2
3 votes
3 votes
3 answers
4
shivangi5 asked Dec 6, 2017
2,862 views
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...