Locking Protocol for Concurrent Access in B*-Trees

Tohru KIKUNO  Noriyoshi YOSHIDA  Kazumasa TANAKA  

IEICE TRANSACTIONS (1976-1990)   Vol.E63   No.1   pp.9-15
Publication Date: 1980/01/25
Online ISSN: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Computers

Full Text: PDF(527.3KB)>>
Buy this Article

The problem of concurrent access to an index structure is that of allowing a maximum number of processes to operate without impairing the correctness of their operations. Recently, Bayer et al. (1977) presented some simple locking protocols to the problem of concurrent access to indexes which are implemented B*-trees. In this paper, we give a new locking protocol that achieves higher concurrency than that of Bayer et al., by minimizing the area on which the exclusive locks are placed. We also show that this solution is deadlock free.