L7.47 | GATE 2016 | Question based on strict schedule recoverability and cascading abort
Question based on strict schedule recoverability and cascading abort
Video Highlights:
Consider the following database schedule with two transactions, T1 and T2.
S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2;
where ri(Z) denotes a read operation by transaction Ti on a variable Z, wi(Z) denotes a write operation by Ti on a variable Z and ai denotes an abort by transaction Ti .
Which one of the following statements about the above schedule is TRUE?
(A) S is non-recoverable
(B) S is recoverable, but has a cascading abort
(C) S does not have a cascading abort
(D) S is strict
#DBMSbyVinodYadav
#GATE_CS_Lectures
#DBMS_Lecture_Series
#SuccessGATEway
#DBMS
#placement
#GATE
#universityexams
#Database_management_system_success_gateway