Consider the following graph based locking protocol, which allow only exclusive lock modes and which operate on datagraph that are in the form of a rooted directed acyclic graph.
- A transaction can lock any vertex point.
- To lock any other vertex, the transaction must have visited all the parents of that vertex and must be having a lock on one of the parents of the vertex. Show that the protocol ensures serializability and deadlock freedom.