| Presentation | 1999/7/23 An Implementation and Evaluation of Fat-Btrees JUN MIYAZAKI, HARUO YOKOTA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We have proposed a parallel index structure for shared-nothing machines, named a Fat-Btree, and shown by using a probability model that the Fat-Btree has quite better throughput than both a single index (SUB) and a copy whole (CWB) strategies. In this paper, we implemented the Fat-Btree to evaluate the performance including various overheads that were not considered in the previous research. The results indicate that the read through put of the Fat-Btree out performs both the SIB and the CWB. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | |
| Paper # | DE99-77 |
| Date of Issue |
| Conference Information | |
| Committee | DE |
|---|---|
| Conference Date | 1999/7/23(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) | An Implementation and Evaluation of Fat-Btrees |
| Sub Title (in English) | |
| Keyword(1) | |
| 1st Author's Name | JUN MIYAZAKI |
| 1st Author's Affiliation | School of Information Science, Japan Advanced Institute of Science and Technology() |
| 2nd Author's Name | HARUO YOKOTA |
| 2nd Author's Affiliation | Graduate School of Information Science and Engineering, Tokyo Institute of Technology |
| Date | 1999/7/23 |
| Paper # | DE99-77 |
| Volume (vol) | vol.99 |
| Number (no) | 203 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |