• edited by
540 views

1 Answer

1 1 vote

s1: True: conflict serializable to schedule >> $T_{1}\rightarrow$$T_{2}\rightarrow T_{3}$

S2: True: allowed in basic  2PL.

s3: False

    strict recoverable schedule>> if transaction $T_{i}$ updates the data item A, then any other transaction $T_{j}$ not allowed to R(A) or W(A) until commit or rollback of $T_{i}$.

                        $T_{i}$                       $T_{j}$
                        W(A)                  
                       .....  
              commit or rollback  
                     R(A) or W(A)

 

s4: False>>>  strict 2PL is basic 2PL in which all exclusive locks should be hold until commit or rollback

                    but here R$_{2}$(B) request for shared lock on B and B is already locked(xclusive) by   $T_{1}$.

Position:
Show:

Related questions

1 1 vote
0 0 answers
900
900 views
learner_geek asked Dec 1, 2017
900 views
In below schedule (S) it has cascading abort or not?
2 2 votes
1 1 answer
1.0k
1.0k views
shivangi5 asked Nov 24, 2017
1,016 views
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________I am getting 54 but the given ans is 60.My doubt i...
1 1 vote
1 1 answer
751
751 views
1 1 vote
1 1 answer
601
601 views