Dllows consider two transactions t, and t, which form schedules s s, s, and s, as fll q. t, r.a], w,[a], w.[b] t ra. rb]. w [b s,: r.a), ra], r,[b]. w,a), w,[b]

dllows Consider two transactions T, and T, which form schedules S S, S, and S, as fll Q. T, R.A], W,[A], W.[B] T RA. RB]. W [B S,: R.A), RA], R,[B]. W,A), W,[B], W,B] S: R.[AJ, R[A], R[B], W,[A]. W.B], W.[B] S,: RA]. R,[A], R[B]. W,[A]. w.B], W.[B] R,AI WLAI RA] w.[B] R[B] W.B] Which of the above is conflict serializable? Sol. (B) Only S,, S S S (A) Only S, (C) S, & S (D) Sol. (C) T T T T S S, r(A) R(A) r(A) R(A) r(B) Q R(B) WA) WA) WB) WB) W(B)