B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives
Previous research addressed the potential problems of the hard-disk oriented design of DBMSs of flashSSDs. In this paper, the authors focus on exploiting potential benefits of flashSSDs. First, they examine the internal parallelism issues of flashSSDs by conducting benchmarks to various flashSSDs. Then, they suggest algorithm-design principles in order to best benefit from the internal parallelism. They 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, they introduce B+-tree optimization methods in order to utilize internal parallelism. By integrating the results of these methods, they present a B+-tree variant, PIO B-tree.