Chapter 18: Problem 29
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.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.