0 votes 0 votes In Graph based Protocol :- Why acquireing second lock on a data item needs to lock their parent data in tree . please explain Databases databases concurrency graph-based-protocol + – indrajeet asked Jun 16, 2016 indrajeet 587 views answer comment Share Follow See 1 comment See all 1 1 comment reply amandeep1426 commented Mar 17 reply Follow Share As in the linked list to access the last node what we follow is: We have the address of the first node in the pointer. Therefore, to access the last data item firstly we need to access the first node, first node has address of second node, second node has address of next node and so on. i.e., without accessing initial nodes we cannot access the last node that is why to access any data item we have to lock its parent first. example is B-tree. for more understanding go through B-tree. 0 votes 0 votes Please log in or register to add a comment.