Question: Consider the following graph-based locking protocol that allows only exclusive lock modes, and that operates on data graphs that are in the form of a
Consider the following graph-based locking protocol that allows only exclusive lock modes, and that operates on data graphs that are in the form of a rooted directed acyclic graph.
• A transaction can lock any vertex first.
• To lock any other vertex, the transaction must have visited all the parents of that vertex, and must be holding a lock on one of the parents of the vertex. Show that the protocol ensures serializability and deadlock freedom.
Step by Step Solution
3.38 Rating (157 Votes )
There are 3 Steps involved in it
The proof is in Kedem and Silb... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
16-CS-DB (337).docx
120 KBs Word File
