Can I read B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives on EtoBox?

B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives by Roh, Hongchan; Park, Sanghyun; Kim, Sungho; Shin, Mincheol; Lee, Sang-Won is a Computer Science article available to read on EtoBox.

What is B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives about?

Previous research addressed the potential problems of the hard-disk oriented design of DBMSs of flashSSDs. In this paper, we focus on exploiting potential benefits of flashSSDs. First, we examine the internal parallelism issues of flashSSDs by conducting benchmarks to various flashSSDs. Then, we suggest algorithm-design principles in order to best benefit from the internal parallelism. We present a new I/O request concept, called __psync__ I/O that can exploit the internal parallelism of flashSSDs in a single process. Based on these ideas, we introduce B+-tree optimization methods in order to utilize internal parallelism. By integrating the results of these methods, we present a B+-tree variant, PIO B-tree. We confirmed that each optimization method substantially enhances the index performance. Consequently, PIO B-tree enhanced B+-tree's insert performance by a factor of up to 16.3, while improving point-search performance by a factor of 1.2. The range search of PIO B-tree was up to 5 times faster than that of the B+-tree. Moreover, PIO B-tree outperformed other flash-aware indexes in various synthetic workloads. We also confirmed that PIO B-tree outperforms B+-tree in index traces

Who reads B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives?

Author

Roh, Hongchan; Park, Sanghyun; Kim, Sungho; Shin, Mincheol; Lee, Sang-Won

Publisher

Very Large Data Base Endowment Inc. (ISSN 2150-8097)

Published

2011

Language

EN

Field

Computer Science (Physical Sciences)