Efficient Tree Indexing for PCM-Based Memory Systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 8th International Conference on Control and Automation, CA 2015
EditorsByeong-Ho Kang, Adrian Stoica, Tai-Hoon Kim
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages46-53
Number of pages8
ISBN (Electronic)9781467398572
DOIs
StatePublished - 18 Mar 2016
Externally publishedYes
Event8th International Conference on Control and Automation, CA 2015 - Jeju Island, Korea, Republic of
Duration: 25 Nov 201528 Nov 2015

Publication series

NameProceedings - 8th International Conference on Control and Automation, CA 2015

Conference

Conference8th International Conference on Control and Automation, CA 2015
Country/TerritoryKorea, Republic of
CityJeju Island
Period25/11/1528/11/15

Keywords

  • B+-tree
  • Overflow Node
  • PCM
  • Read/Write Tendency

Fingerprint

Dive into the research topics of 'Efficient Tree Indexing for PCM-Based Memory Systems'. Together they form a unique fingerprint.

Cite this