a) Show that this schedule is conflict serializable, via a precedence graph. b) Show that this
schedule is view serializable. c) Apply the following concurrency control mechanisms: i. Two-
phase locking i1. Timestamping (TS(T1)=1,TS(T2)=2).
a) Show that this schedule is conflict serializable, via a precedence.pdf
1. a) Show that this schedule is conflict serializable, via a precedence graph. b) Show that this
schedule is view serializable. c) Apply the following concurrency control mechanisms: i. Two-
phase locking i1. Timestamping (TS(T1)=1,TS(T2)=2)