R -tree for phase change memory

Elkhan Jabarov, Byung Won On, Gyu Sang Choi, Myong Soon Park

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Nowadays, many applications use spatial data for instance-location information, so storing spatial data is important.We suggest using R -Tree over PCM. Our objective is to design a PCM-sensitive R -Tree that can store spatial data as well as improve the endurance problem. Initially, we examine how R -Tree causes endurance problems in PCM, and we then optimize it for PCM. We propose doubling the leaf node size, writing a split node to a blank node, updating parent nodes only once and not merging the nodes after deletion when the minimum fill factor requirement does not meet. Based on our experimental results while using benchmark dataset, the number of write operations to PCM in average decreased by 56 times by using the proposed R -Tree. Moreover, the proposed R -Tree scheme improves the performance in terms of processing time in average 23% compared to R -Tree.

Original languageEnglish
Pages (from-to)347-367
Number of pages21
JournalComputer Science and Information Systems
Volume14
Issue number2
DOIs
Publication statusPublished - 2017 Jun 1

Keywords

  • Endurance
  • Indexing algorithm
  • PCM
  • R -Tree
  • Spatial data
  • Spatial database
  • Spatial tree

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'R -tree for phase change memory'. Together they form a unique fingerprint.

  • Cite this