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

• Item type: Trans(1)
• 公開日: 2004-12-15
• タイトル: PO - P : A Concurrency Control Protocol for Parallel B - trees
• タイトル / 言語: en
• タイトル: PO - P : A Concurrency Control Protocol for Parallel B - trees
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 研究論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Faculty of Engineering Gunma University
• 著者所属: Faculty of Engineering Gunma University
• 著者所属: Faculty of Engineering Gunma University
• 著者所属(英): en
• 著者所属(英): Faculty of Engineering, Gunma University
• 著者所属(英): en
• 著者所属(英): Faculty of Engineering, Gunma University
• 著者所属(英): en
• 著者所属(英): Faculty of Engineering, Gunma University
• 著者名: Damdinsuren, Amarmend; Masayoshi, Aritsugi; Yoshinari, Kanamori
• 著者名(英): Damdinsuren, Amarmend; Masayoshi, Aritsugi; Yoshinari, Kanamori
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464847
• 書誌情報: 情報処理学会論文誌データベース（TOD）; 巻 45, 号 SIG14(TOD24), p. 30-38, 発行日 2004-12-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7799
• 出版者 / 言語: ja
• 出版者: 情報処理学会