Add the operation commit at the end of each of the transactions T₁ and T₂ in Figure 20.2, and then list all possible schedules for the modified transactions. Determine which of the schedules are recoverable, which are cascadeless, and which are strict.

Transcribed Image Text:

(a) (b) T2 read_item(X); X=X- N; write_item(X); read_item(Y); Y = Y+ N; write_item(Y); read_item(X); X= X+ M; Figure 20.2 Two sample write_item(X); transactions. (a) Transaction T1. (b) Transaction T