Circ-Tree: A B+-Tree Variant with Circular Design for Persistent Memory

by   Chundong Wang, et al.

Several B+-tree variants have been developed to exploit the performance potential of byte-addressable non-volatile memory (NVM). In this paper, 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 the node. These 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 KV pairs. This badly impairs the performance of in-NVM B+-tree. In this paper, we propose a novel circular design for B+-tree. With regard to NVM's byte-addressability, our Circ-tree design embraces tree nodes in a circular structure without a fixed base address, and bidirectionally shifts KV pairs in a node 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.6x and 8.6x, respectively, in terms of write performance. The end-to-end comparison by running YCSB to KV store systems built on NV-tree, FAST+FAIR, and Circ-Tree reveals that Circ-Tree yields up to 29.3 respectively, than NV-tree and FAST+FAIR.


page 2

page 4

page 6

page 7

page 8

page 9

page 10

page 11


On Performance Stability in LSM-based Storage Systems

The Log-Structured Merge-Tree (LSM-tree) has been widely adopted for use...

Accelerating LSM-Tree with the Dentry Management of File System

The log-structured merge tree (LSM-tree) gains wide popularity in buildi...

AisLSM: Revolutionizing the Compaction with Asynchronous I/Os for LSM-tree

The log-structured merge tree (LSM-tree) is widely employed to build key...

Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs

Solid-state drives (SSDs) are extensively used to deploy persistent data...

Boosting the Search Performance of B+-tree for Non-volatile Memory with Sentinels

The next-generation non-volatile memory (NVM) is striding into computer ...

Phoenix: Towards Persistently Secure, Recoverable, and NVM Friendly Tree of Counters

Emerging Non-Volatile Memories (NVMs) bring a unique challenge to the se...

A fair comparison of many max-tree computation algorithms (Extended version of the paper submitted to ISMM 2013

With the development of connected filters for the last decade, many algo...

Please sign up or login with your details

Forgot password? Click here to reset