For each of the following schedules, state whether the schedule is serializable, conflict-serializable, view-serializable, recoverable, and whether
Question:
(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)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Database Systems A Practical Approach to Design Implementation and Management
ISBN: 978-0132943260
6th Edition Global
Authors: Thomas Connolly, Carolyn Begg
Question Posted: