利用闪存驱动器内部特性优化B+树索引
B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives
摘要:
以前的研究解决了面向硬盘的设计的数据库管理系统的闪存固态硬盘的潜在问题。在本文中,我们专注于利用闪存SSD的潜在优势。首先,我们通过对各种flashSSD进行基准测试来研究flashSSD的内部并行性问题。然后,我们建议算法设计原则,以最大限度地受益于内部并行。我们提出了一种新的I/O请求概念,称为psync I/O,可以在单个进程中利用flashSSD的内部并行性。基于这些思想,我们引入B+树优化方法,以利用内部并行。通过综合这些方法的结果,我们提出了一个B+树的变种,PIO B树。我们证实,每一种优化方法大大提高了索引性能。因此,PIO B树将B+树的插入性能提高了16.3倍,同时将点搜索性能提高了1.2倍。PIO B树的范围搜索速度比B+树快5倍。此外,PIO B树在各种合成工作负载中的性能优于其他闪存感知索引。我们还证实,PIO B树优于B+树的索引跟踪收集内部的PostgreSQL数据库管理系统与TPC-C基准。
英文摘要:
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 collected inside the Postgresql DBMS with TPC-C benchmark.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。