Chapter 18: Problem 4
Compare binary locks to exclusive/shared locks. Why is the latter type of locks preferable?
Chapter 18: Problem 4
Compare binary locks to exclusive/shared locks. Why is the latter type of locks preferable?
All the tools & learning materials you need for study success - in one app.
Get started for freeWhat is the two-phase locking protocol? How does it guarantee serializability?
Describe the wait-die and wound-wait protocols for deadlock prevention.
The MGL protocol states that a transaction \(\mathrm{T}\) can unlock a node \(\mathrm{N}\), only if none of the children of node \(\mathrm{N}\) are still locked by transaction \(\mathrm{T}\). Show that without this condition, the MGL protocol would be incorrect.
Discuss the problems of deadlock and starvation, and the different approaches to dealing with these problems.
What are some variations of the two-phase locking protocol? Why is strict or rigorous two-phase locking often preferred?
What do you think about this solution?
We value your feedback to improve our textbook solutions.