Efficient Tree Indexing for PCM-Based Memory Systems

In this paper, we propose an improvement over the B+-tree for phase change memory (PCM). Particularly, we consider the read/write tendency of leaf nodes. For write-intensive leaf nodes, we use an overflow-node technique to reduce PCM writes, while for read-intensive leaf nodes, we adjust the tree structure to remove overflow nodes to improve read performance. Our experimental results suggest that our proposal is efficient for PCM.