|
|
|
 |
|
 |
|
A Restructuring Method for the Concurrent B
|
Sungchae Lim,
Yoon Joon Lee, and
Myoung Ho Kim
View Paper (PDF)
Return to Session 4B: Index Techniques
As the B-tree index could
be a peformance bottleneck in database systems, concurrent B-tree algorithms
have been intensively studied to improve concurrency of B-tree accesses in the
literature. In this paper we propose a new concurrent B+ -tree algorithm for
high concurrency and an eficient tree restructuring method. Because the
proposed method of tree restructuring always preserves a semantic consistency of
the B+ -tree, a key searcher need not require any lock for a range search as well
as a single-key search. To maintain correctly the linkfields constructed at the
leaf level, we make each leaf node contain two key-range indicators, and develop
a tree restructuring method using these key-range indicators.
Copyright(C) 2000 ACM
|
|
|
|
|
|
|
