Consider the four transactions T1, T2, T3, T4 and the schedules S given below. T1: w1(A); w1(B) T2: r2(A); r2(C); w2(D) T3: r3(B); w3(E) T4: r4(D), w4(E) S: w1(A), r2(A), w1(B), r2(C), r3(B), w2(D), w3(E), r4(D), w4(E) Draw the serializability (precedence) graph for S If S is serializable, write down the equivalent serial schedule(s). What is Partitioning? Why we use it? Discuss its types with examples.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |