edited by
902 views
1 votes
1 votes

Consider a Serial Schedule given-

T1 T2 T3
w1(A)    
w1(B)    
  r2(A)  
  w2(B)  
    r3(A)
    w3(B)
     

How many schedules which are view equivalent to above schedule?

How many schedules which are confilct equivalent to above schedule?

Is this schedule conflict serializable/ view serializable? If yes How many serial schedules are possible which are conflict equivalent/ view equivalent to able schedule?

edited by

2 Answers

2 votes
2 votes
Answer to all asked questions is only one serial schedule which is T1-T2-T3.As the given schedule is already a serial one, now u can not move up/down any of the transaction due to conflict pairs.
0 votes
0 votes

number of view equivalant schedules = 12-1 => 11 and conflict equivalant = 8

small mistake = R3(A) CAN be placed at 4 different places instead of 3 so 

number of schedule will be 8 instead of 6 

and discarding one schedule because it is already given in question

anyone can suggest how to rotate the ?

edited by

Related questions

1 votes
1 votes
2 answers
1
6 votes
6 votes
3 answers
3
Prabhanjan_1 asked Dec 24, 2016
5,015 views
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
1 votes
1 votes
1 answer
4
Gate Madrista asked Jan 28, 2017
521 views
Do commit operations matter while checking serilizability?If yes why?