in Databases
239 views
3 votes
3 votes
consider the following transactions

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

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

a)how many schedules serializable as

T1-->T2

what this question is asking??
in Databases
by
239 views

3 Comments

He wants to ask all those concurrent schedules which can be serialized as t1-> t2
0
0
how we will find out please help?
0
0
You need to find concurrent conflict serializable schedule which means order of all conflicts(ww/wr/rw) between t1 and t2 must be in order t1->t2
For eg : i may wish to executed r2(b) just after r1(a)  in order to achieve concurrency instead of waiting for t1 to finish
but you have to take care of given condition as i mentioned in first line
Now if u put r2(b) anywhere before w1(b)  you will see there will be a conflict from T2 to T1 which is not allowed
so only concurrent schedule possible is
X:r1(A)w1(A)r1(B)w1(B)r2(B)w2(B)r2(A)w2(A)
which is a serial schedule :D
If u are still confused lemme know :)
0
0

Please log in or register to answer this question.