Question

If we apply a distributed version of the multiple-granularity protocol of Chapter to a distributed database, the site responsible for the root of the DAG may become a bottleneck. Suppose we modify that protocol as follows:
• Only intention-mode locks are allowed on the root.
• All transactions are given all possible intention-mode locks on the root automatically. Show that these modifications alleviate this problem without allowing any nonserializable schedules.


$1.99
Sales0
Views152
Comments0
  • CreatedJanuary 29, 2011
  • Files Included
Post your question
5000