A Comparative Study of Concurrency Control Methods in B-Trees

In this paper, we described a number concurrency control methods for B-trees. Among them, a protocol which allows a number of independent search, insertion, and deletion processes, acting concurrently on a B-tree, to operate even when multiple insertions or deletions are pending. A number of properties have been also proposed to compare such protocols. The set of properties includes the number of lock types being used, degree of data sharing, number of processes that are permitted to access a node simultaneously, how fast a reader can reach the leaf node, number of nodes locked by the three processes during their operation, number of nodes being accessed sequentially, and the number an updater passes through the tree. Based on these properties, seven protocols are compared and discussed.