1,472 views

1 Answer

1 votes
1 votes
Conditions for view equal:

Initial  Read : -

Updated Read: 1>2,3>4,5>6,7>8,9>10

Final write : 9

So 9>10 transaction order is at the final ,with the other 4 precedences permutations.

Total permutations of 1>2,3>4,5>6,7>8 = 4! = 24 ways ( including the one given in the question)

We can observe that since every transaction is conflicting with every adjacent transaction , no other schedule is conflict equivalent.
So total number of view equal schedules to above and not conflict equivalent = 23

Related questions

3 votes
3 votes
3 answers
2
shivangi5 asked Dec 6, 2017
2,835 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(...
3 votes
3 votes
2 answers
3