The search functionality is under construction.
The search functionality is under construction.

Concurrency Control and Performance Evaluation of Parallel B-tree Structures

Jun MIYAZAKI, Haruo YOKOTA

  • Full Text Views

    0

  • Cite this

Summary :

The Fat-Btree which is a new parallel B-tree structure has been proposed to improve the access performance of shared-nothing parallel database systems. Since the Fat-Btree has only a part of index nodes on each processing element, it can reduce the synchronization cost in update operations. For these reasons, both retrieval and update operations can be processed at high throughput compared to previously proposed parallel B-tree structures for shared-nothing computers. Though we tried to apply some conventional concurrency control methods to the Fat-Btree, e.g., B-OPT and ARIES/IM, which were designed for shared-everything machines, we found that these methods are not always appropriate for the Fat-Btree. In this paper, it is shown that the conventional methods are not suitable for the Fat-Btree and other parallel B-trees. We propose a new deadlock free concurrency control protocol, named INC-OPT, to improve the performance of the Fat-Btree more effectively than the B-OPT and ARIES/IM. Furthermore, in order to prove that the Fat-Btree provides the impact on the performance of shared-nothing parallel databases, we compare the real performance of three types of parallel B-tree structures, Fat-Btree, Copy-Whole-Btree, and Single-Index-Btree, on an nCUBE3 machine where the INC-OPT is applied.

Publication
IEICE TRANSACTIONS on Information Vol.E85-D No.8 pp.1269-1283
Publication Date
2002/08/01
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Databases

Authors

Keyword