Database Systems 6th Edition by Ramez Elmasri, Shamkant B. Navathe

تمرين 10

Consider schedules S3, S4, and S5 below. Determine whether each schedule is strict, cascadeless, recoverable, or nonrecoverable. (Determine the strictest recoverability condition that each schedule satisfies.)
S3: r₁(X); r2(z); r1(z); r₃(X); r₃(y); w₁(X); c1; w₃(y); c3; r₂(y); w2(z); w₂(y);c2
S4: r₁(X); r2(z); r1(z); r₃(X); r₃(y); w₁(X); w₃(y); r₂(y); w2(z); w₂(y); c1; c2; c3;
S5: r₁(X); r2(z); r₃(X); r1(z); r₂(y); r₃(y); w₁(X); w2(z); w₃(y); w₂(y); c3; c2;