PO-P : A Concurrency Control Protocol for Parallel B-trees

概要

論文の詳細を見る
A number of parallel and distributed B-tree structures for shared-nothing parallel database systems have been proposed in connection with the related technological advancements such as clustered computers. We focus on the performance of the concurrency control protocols for such parallel B-trees and consider the possibility and the suitability of introduction of preparatory operations such as preemptive node split or merge to them in this paper. Since the early top-down concurrency control protocols were only designed for shared-everything architecture, it is inappropriate to directly apply them to the distributed environment because the way update processes traverse the B-tree may cause significant degradations in the system performance. In this paper, we propose a protocol, named preparatory operations-parallel (PO-P), in which such preparatory operations are used during traversals of update processes. The results of our implementation of PO-P on a parallel B-tree in comparison with the existing protocol INC-OPT prove that the PO-P can serve as a good alternative protocol for distributed parallel B-trees.
一般社団法人情報処理学会の論文
2004-12-15