Question: a. Suppose schedule S, is defined as follows. [8] Sa reada(M ); write,(M ):read2(X); read (M); reada(Y);read (Z ):write,(Z );reada(Z )write(Y );reada(Y): read (M
![a. Suppose schedule S, is defined as follows. [8] Sa reada(M );](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2021/06/60cb0b881c652_Screenshot20210617141405.jpg)
a. Suppose schedule S, is defined as follows. [8] Sa reada(M ); write,(M ):read2(X); read (M); reada(Y);read (Z ):write,(Z );reada(Z )write(Y );reada(Y): read (M ):write2(M); Where, data items: X,YZ.M; read (X) means read operation performed on data item X by Transaction i; write,(X) means write operation performed on data item X by Transaction i; Is S, (conflict) serializable? Justify your answer. b. "Shadow paging technique can be categorized as UNDO/REDO technique for recovery." Is the statement correct? Justify. [4]
Step by Step Solution
3.45 Rating (148 Votes )
There are 3 Steps involved in it
Her... View full answer
Get step-by-step solutions from verified subject matter experts
