Pivotal B+tree for Byte-Addressable Persistent Memory
Over the past few years, various indexes have been redesigned for byte-addressable persistent memory. In this work, we design and implement <italic>PB</italic>+<italic>tree</italic> (Pivotal B+tree) that resolves the limitations of state-of-the-art fully...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9764757/ |