Question: Consider a database system holding the records shown below that implements hierarchical multiple granularity locking protocol. Suppose transaction TO acquired locks on DB, A0
Consider a database system holding the records shown below that implements hierarchical multiple granularity locking protocol. Suppose transaction TO acquired locks on DB, A0 and F1 as shown in Figure 4. For each of the following trans- actions, indicate what kind of locks on which tree node it can acquire or not. Justify your answer. T Fo T T (a) Read(T5) (b) Write(T2) (c) Add a new tree node A2 under DB. (d) Read (DB) and Write(A1) DB To(IX) Ao To(IX) F To(x) T4 Ts Figure 4: Granularity Hierarchy A T6
Step by Step Solution
3.57 Rating (154 Votes )
There are 3 Steps involved in it
a ReadT5 T5 can acquire an S lock on DB AO and F1 since To has already acquired S locks on these nod... View full answer
Get step-by-step solutions from verified subject matter experts
