Question: Draw a precedence graph for each of the schedules (a) (e) in the previous exercise. (a) Read(T1, balx), read(T2, balx), write(T1, balx), write(T2, balx),
Draw a precedence graph for each of the schedules (a) – (e) in the previous exercise.
(a) Read(T1, balx), read(T2, balx), write(T1, balx), write(T2, balx), commit(T1), commit(T2)
(b) Read(T1, balx), read(T2, baly), write(T3, balx), read(T2, balx), read(T1, baly), commit(T1), commit(T2)
(c) Read(T1, balx), write(T2, balx), write(T1, balx), abort(T2), commit(T1)
(d) Write(T1, balx), read(T2, balx), write(T1, balx), commit(T2), abort(T1)
(e) read(T1, balx), write(T2, balx), write(T1, balx), read(T3, balx), commit(T1), commit(T2), commit(T3)
Step by Step Solution
3.49 Rating (172 Votes )
There are 3 Steps involved in it
a Cycle so not serializable b No cycle so serializable c Without ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
672-CS-DB (1423).docx
120 KBs Word File
