1,913 views
1 1 vote
Number of serial schedules but not conflict to schedule (S)

S: r1(A),r2(A),r3(A),r4(A),w1(B),w2(B),w3(B),w4(B)

1 Answer

0 0 votes
Number of serial schedules which are view equivalent to S but not conflict equivalent to schedule S

Conflict equivalent Schedule is

T1->T2->T3->T4

view equivalent Schedule are

1. first read same

2. final write same

3. w-R dependency on same on same data item

T4 should be last bcz it is final write. T1,T2,T3 can be in any order for view equivalent. Here read operation doesn't matter bcz it is on single data item

Answer is 3!-1=5
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.4k
1.4k views
Rutuja Desai asked Dec 2, 2021
1,424 views
I had a doubt.In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsback ...
2 2 votes
0 0 answers
505
505 views
Dknights asked Jan 4, 2025
505 views
can someone please explain the working of computation in database transactions is the following computation correct?Time Transaction 1 (T1) Transaction 2 (T2) A (Value) 1...
0 0 votes
1 1 answer
779
779 views
jayadev asked Dec 30, 2021
779 views
When Ti attempts to write data item Q, if TS(Ti ) < w-timestamp(Q), then Ti is attempting to write an obsolete valueof {Q}. Rather than rolling back Ti as the timestamp o...
0 0 votes
1 1 answer
769
769 views