Presentation 2002/7/10
Practical use of the Cache in Paging B-tree for Parallel Environment
Shogo OGURA, Takao MIURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose Paging B-tree for the purpose of parallel database processing and well-balancing of data distribution. By the technique we can divide a B-tree into several pages which contain the sub-trees. We give the relationship between the logical and the physical trees. Physical B-trees are managed independent of logical ones so that we can move them into any processors to obtain well-balance of data distribution. In this work, we consider practical use of the cash in Paging B tree. And we verify the usefulness by experiment.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Parallel / B-tree / Paging / Cache
Paper # DE2002-21
Date of Issue

Conference Information
Committee DE
Conference Date 2002/7/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Practical use of the Cache in Paging B-tree for Parallel Environment
Sub Title (in English)
Keyword(1) Parallel
Keyword(2) B-tree
Keyword(3) Paging
Keyword(4) Cache
1st Author's Name Shogo OGURA
1st Author's Affiliation Dept.of Elect.& Elect. Engr., HOSEI University()
2nd Author's Name Takao MIURA
2nd Author's Affiliation Dept.of Elect.& Elect. Engr., HOSEI University
Date 2002/7/10
Paper # DE2002-21
Volume (vol) vol.102
Number (no) 207
Page pp.pp.-
#Pages 4
Date of Issue