Ändringar mellan två versioner
Här visas ändringar i "Recitation #3" mellan 2015-05-07 10:43 av Michael Minock och 2015-05-07 10:47 av Michael Minock.
Visa < föregående | nästa > ändring.
Recitation #3
*** Still not finished (Bbut what is here will not be retractedyou can at least start...) *** Paper Problems 1. r_1(x), r_2(x), w_1(x),w_2(x)
Write the DSG for the above schedule.Is this schedule conflict serializable? Is this schedule view serializable?
2. w_2(z),r_1(x),r_1(y),r_2(y),w_1(x),r_2(x),w_2(y),w_1(z),w_2(z)
Is this schedule conflict serializable? Is this schedule view serializable?
3. Assume that the following schedule with locks is executed over a SVCC mechanism.
rlk_1(x), r_1(x), rlk_2(x), wlk_1(x),w_1(x),ulk_1(x),cmt_1, wlk_2(x),w_2(x),ulk_2(x), cmt_2
Describe what happens.Does this schedule respect 2PL, SS2PL (AKA ‘Rigorous’), Conservative 2PL?
To be continued...
System Exercises