当前位置: X-MOL 学术IEEE Trans. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Circ-Tree: A B+-Tree Variant With Circular Design for Persistent Memory
IEEE Transactions on Computers ( IF 3.7 ) Pub Date : 2021-01-01 , DOI: 10.1109/tc.2020.3047972
Chundong Wang , Gunavaran Brihadiswarn , Xingbin Jiang , Sudipta Chattopadhyay

Several B+-tree variants have been developed to exploit the byte-addressable non-volatile memory (NVM). We attentively investigate the properties of B+-tree and find that, a conventional B+-tree node is a linear structure in which key-value (KV) pairs are maintained from the zero offset of a node. These KV pairs are shifted in a unidirectional fashion for insertions and deletions. Inserting and deleting one KV pair may inflict a large amount of write amplifications due to shifting existing KV pairs. This badly impairs the performance of in-NVM B+-tree. In this article, we propose a novel circular design for B+-tree. With regard to NVM's byte-addressability, our Circ-Tree embraces tree nodes in a circular structure without a fixed base address, and bidirectionally shifts KV pairs for insertions and deletions to minimize write amplifications. We have implemented a prototype for Circ-Tree and conducted extensive experiments. Experimental results show that Circ-Tree significantly outperforms two state-of-the-art in-NVM B+-tree variants, i.e., NV-tree and FAST+FAIR, by up to 1.6× and 8.6×, respectively, in terms of write performance. The end-to-end comparison by running YCSB to KV stores built on NV-tree, FAST+FAIR, and Circ-Tree reveals that Circ-Tree yields up to 29.3 and 47.4 percent higher write performance, respectively, than NV-tree and FAST+FAIR.

中文翻译:

Circ-Tree:一种 B+-Tree 变体,具有用于持久内存的循环设计

已经开发了几种 B+-tree 变体来利用字节可寻址非易失性存储器 (NVM)。我们仔细研究了 B+-tree 的特性,发现传统的 B+-tree 节点是一个线性结构,其中键值 (KV) 对从节点的零偏移量开始保持。这些 KV 对以单向方式移动以进行插入和删除。由于移动现有的 KV 对,插入和删除一个 KV 对可能会造成大量的写入放大。这严重损害了 in-NVM B+-tree 的性能。在本文中,我们为 B+-tree 提出了一种新颖的圆形设计。关于 NVM 的字节寻址能力,我们的 Circ-Tree 在没有固定基地址的循环结构中包含树节点,并双向移动 KV 对以进行插入和删除,以最大限度地减少写入放大。我们已经实现了 Circ-Tree 的原型并进行了广泛的实验。实验结果表明,Circ-Tree 在写入方面显着优于两种最先进的 in-NVM B+-tree 变体,即 NV-tree 和 FAST+FAIR,分别高达 1.6 倍和 8.6 倍表现。通过运行 YCSB 与基于 NV-tree、FAST+FAIR 和 Circ-Tree 的 KV 存储进行的端到端比较表明,与 NV-tree 和 Circ-Tree 相比,Circ-Tree 的写入性能分别提高了 29.3% 和 47.4%。快速+公平。
更新日期:2021-01-01
down
wechat
bug