MadeEasy Test Series 2019: Databases - Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
commented
Jan 24, 2019
in Databases
1.2k views