285 views
0 votes
0 votes
Consider a database organized in the form of a rooted tree. Suppose that we insert a dummy vertex between each pair of vertices. Showthat, 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.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
akash.dinkar12 asked Apr 1, 2019
1,034 views
Most implementations of database systems use strict two-phase locking. Suggest three reasons for the popularity of this protocol.
0 votes
0 votes
1 answer
2
akash.dinkar12 asked Apr 1, 2019
315 views
What benefit does rigorous two-phase locking provide ? How does it compare with other forms of two-phase locking ?
0 votes
0 votes
2 answers
3