Locking Protocol for Concurrent Access in B*-Trees
Summary :
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.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E63-E No.1 pp.9-15
- Publication Date
- 1980/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computers
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tohru KIKUNO, Noriyoshi YOSHIDA, Kazumasa TANAKA, "Locking Protocol for Concurrent Access in B*-Trees" in IEICE TRANSACTIONS on transactions,
vol. E63-E, no. 1, pp. 9-15, January 1980, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e63-e_1_9/_p
Copy
@ARTICLE{e63-e_1_9,
author={Tohru KIKUNO, Noriyoshi YOSHIDA, Kazumasa TANAKA, },
journal={IEICE TRANSACTIONS on transactions},
title={Locking Protocol for Concurrent Access in B*-Trees},
year={1980},
volume={E63-E},
number={1},
pages={9-15},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Locking Protocol for Concurrent Access in B*-Trees
T2 - IEICE TRANSACTIONS on transactions
SP - 9
EP - 15
AU - Tohru KIKUNO
AU - Noriyoshi YOSHIDA
AU - Kazumasa TANAKA
PY - 1980
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E63-E
IS - 1
JA - IEICE TRANSACTIONS on transactions
Y1 - January 1980
AB - 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.
ER -
English
