List all possible schedules for transactions T₁ and T₂ in Figure 20.2, and determine which are conflict serializable (correct) and which are not.

Figure 20.2

Transcribed Image Text:

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