1.

Consider A Database Organized In The Form Of A Rooted Tree. Suppose That We Insert A Dummy Vertex Between Each Pair Of Vertices. Show That, If We Follow The Tree Protocol On The New Tree, We Get Better Concurrency Than If We Follow The Tree Protocol On The Original Tree?

Answer»

The proof is in Buckley and Silberschatz, “Concurrency Control in Graph Protocols by USING Edge Locks,” PROC. ACM SIGACT-SIGMOD SYMPOSIUM on the Principles of DATABASE Systems, 1984.

The proof is in Buckley and Silberschatz, “Concurrency Control in Graph Protocols by Using Edge Locks,” Proc. ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, 1984.



Discussion

No Comment Found

Related InterviewSolutions