Persistent B+-Trees in Non-Volatile Main Memory

By Shimin Chen, Qin Jin. Proceedings of the VLDB Endowment, 2015

357 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture, Information Systems

View Paper: https://www.semanticscholar.org/paper/113ac03cc028534fd6fe45459daf56af5e2c55ca

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Steven Swanson
2. Kian-Lee Tan
3. Beng Chin Ooi
4. Meihui Zhang
5. Jian Xu
6. Hao Zhang
7. Gang Chen

In Hardware and Architecture

1. Steven Swanson
2. Kian-Lee Tan
3. Beng Chin Ooi
4. Meihui Zhang
5. Jian Xu
6. Hao Zhang
7. Gang Chen

In Information Systems

1. Steven Swanson
2. Kian-Lee Tan
3. Beng Chin Ooi
4. Meihui Zhang
5. Jian Xu
6. Hao Zhang
7. Gang Chen

Citations in the corpus

• NOVA: A Log-structured File System for Hybrid Volatile/Non-volatile Main Memories (2016, background): “, tree structures) are more difficult to implement correctly and efficiently in NVMM [15, 40, 65, 75].”
• In-Memory Big Data Management and Processing: A Survey (2015, methodology): “And current solutions to the write ordering and atomicity problems are either relying on some newly-proposed hardware primitives, such as atomic 8-byte writes and epoch barriers [129], [203], [210], or leveraging existing hardware primitives, such as cache modes (e.”
• An Empirical Guide to the Behavior and Use of Scalable Persistent Memory (2019, background): “Various authors have built intricate NVM data structures for data storage and transaction processing [45, 63, 11, 10, 44, 29, 24, 3, 39, 51].”