1,612 views
4 votes
4 votes
Consider the following transactions

T1:r1(A) w1(A) r1(B) w1(B)

T2:r2(B) w2(B) r2(A) w2(A)

1) How many schedules serializable as T1->T2

2) How many schedules serializable as T2->T1

1 Answer

0 votes
0 votes
Both Schedule  T1 → T2 and T2 → T1 are identical so both have same answer . so 5,6 is not possible

Correct answer is 6,6

Related questions

2 votes
2 votes
0 answers
1
0 votes
0 votes
1 answer
2
Kaustubh _15 asked Dec 15, 2017
467 views
The above question has a blind write so it should be View Serializable. But can it be Conflict Serializable?