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

Fingerprint

Phase change memory
Pulse code modulation
Durability
Merging
Processing

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

R -tree for phase change memory. / Jabarov, Elkhan; On, Byung Won; Choi, Gyu Sang; Park, Myong Soon.

In: Computer Science and Information Systems, Vol. 14, No. 2, 01.06.2017, p. 347-367.

Research output: Contribution to journalArticle

Jabarov, Elkhan ; On, Byung Won ; Choi, Gyu Sang ; Park, Myong Soon. / R -tree for phase change memory. In: Computer Science and Information Systems. 2017 ; Vol. 14, No. 2. pp. 347-367.
@article{56d4bf9166c34e4d9930fd43530941af,
title = "R -tree for phase change memory",
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.",
keywords = "Endurance, Indexing algorithm, PCM, R -Tree, Spatial data, Spatial database, Spatial tree",
author = "Elkhan Jabarov and On, {Byung Won} and Choi, {Gyu Sang} and Park, {Myong Soon}",
year = "2017",
month = "6",
day = "1",
doi = "10.2298/CSIS160620008J",
language = "English",
volume = "14",
pages = "347--367",
journal = "Computer Science and Information Systems",
issn = "1820-0214",
publisher = "ComSIS Consortium",
number = "2",

}

TY - JOUR

T1 - R -tree for phase change memory

AU - Jabarov, Elkhan

AU - On, Byung Won

AU - Choi, Gyu Sang

AU - Park, Myong Soon

PY - 2017/6/1

Y1 - 2017/6/1

N2 - 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.

AB - 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.

KW - Endurance

KW - Indexing algorithm

KW - PCM

KW - R -Tree

KW - Spatial data

KW - Spatial database

KW - Spatial tree

UR - http://www.scopus.com/inward/record.url?scp=85021906473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021906473&partnerID=8YFLogxK

U2 - 10.2298/CSIS160620008J

DO - 10.2298/CSIS160620008J

M3 - Article

AN - SCOPUS:85021906473

VL - 14

SP - 347

EP - 367

JO - Computer Science and Information Systems

JF - Computer Science and Information Systems

SN - 1820-0214

IS - 2

ER -