Consider the schedule S1 consists of three transactions T1, T2, T3 as the following: Answer the following question: Is the schedule S1 cascadeless and recoverable? Justify your answer. Draw the...

Consider the schedule S1 consists of three transactions T1, T2, T3 as the following:

Answer the following question:

1. Is the schedule S1 cascadeless and recoverable? Justify your answer.


2. Draw the precedence graph of schedule S1


3. Is S1 conflict-serializable? Explain briefly. If S1 is conflict-serializable, write down all equivalent serial schedules.

Extracted text: S1 T1 T2 T3 R(A) R(B) W(B) R(B) R(C) commit R(D) commit R(D) Commit