Consider the following ordering S of transactions T1 : R(X); T2 : R(X); T1 : w(x); T1 : r(y); T2 : w(x); T2 : Commit; T1: w(y) ; T1: Commit Which of the following is true?
A) It is a strict schedule
B) Cascade less schedule
Option (b) is correct
Cascade less schedule is the one in which, for each pair of transactions T1 & Ts such that Tj reads the data item previously written by Ti, the commit (or) abort operation of Ti must appear before read of Ij