Explain the distinction between the terms serial schedule and serializable schedule.
Answer to relevant QuestionsConsider the following two transactions: T1: read (A); read (B); if A = 0then B: = B + 1; write (B). T2: read (B); read (A); if B = 0 then A: = A + 1; write (A). Let the consistency requirement be A = 0 ∨ B = 0, ...Consider the following two transactions:T31: read (A); read (B);If A = 0 then B: = B + 1; write (B).T32: read (B); read (A);If B = 0 then A: = A + 1; write (A).Add lock and unlock instructions to transactions T31 and T32, so ...Consider the following graph-based locking protocol, which allows only exclusive lock modes, and which operates on data graphs that are in the form of a rooted directed acyclic graph.• A transaction can lock any vertex ...Use of multiple-granularity locking may require more or fewer locks than an equivalent system with a single lock granularity. Provide examples of both situations, and compare the relative amount of concurrency allowed.Suppose that we use the tree protocol of Section 16.1.5 to manage concurrent access to a B+-tree. Since a split may occur on an insert that affects the root, it appears that an insert operation cannot release any locks until ...
Post your question