Question: Consider two transactions T1 and T2 operating on database objects A and B. T1 : R1(A), R1(B), W1(B) T2 : W2(A), R2(B), W2(B) (a) What
Consider two transactions T1 and T2 operating on database objects A and B. T1 : R1(A), R1(B), W1(B) T2 : W2(A), R2(B), W2(B)
(a) What is the total number of possible schedules of transactions T1 and T2 ? (1 point)
(b) Among the possible schedules of transactions T1 and T2, how many are conflict-equivalent to the serial order (T1, T2) ? (2 point)
(c) Determine the number of possible conflict serializable schedules. (3 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
