R -tree for phase change memory

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

doi:10.2298/CSIS160620008J

R -tree for phase change memory

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

* Honorary professors

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	347-367
Number of pages	21
Journal	Computer Science and Information Systems
Volume	14
Issue number	2
DOIs	https://doi.org/10.2298/CSIS160620008J
Publication status	Published - 2017 Jun

Keywords

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

ASJC Scopus subject areas

Computer Science(all)

Access to Document

10.2298/CSIS160620008J

Cite this

@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}",

note = "Funding Information: This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. NRF-2013R1A1A1012524) for the second author (Byung-Won On) and supported by the Ministry of Trade, Industry & Energy (MOTIE, Korea) under the Industrial Technology Innovation Program, No. 10063130, by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2016R1A2B4007498), and the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2016- R2718-16-0035) supervised by the IITP (Institute for Information & communications Technology Promotion) for third author (Gyu Sang Choi). Publisher Copyright: {\textcopyright} 2017 ComSIS Consortium. All rights reserved.",

year = "2017",

month = jun,

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

N1 - Funding Information: This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. NRF-2013R1A1A1012524) for the second author (Byung-Won On) and supported by the Ministry of Trade, Industry & Energy (MOTIE, Korea) under the Industrial Technology Innovation Program, No. 10063130, by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2016R1A2B4007498), and the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2016- R2718-16-0035) supervised by the IITP (Institute for Information & communications Technology Promotion) for third author (Gyu Sang Choi). Publisher Copyright: © 2017 ComSIS Consortium. All rights reserved.

PY - 2017/6

Y1 - 2017/6

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

U2 - 10.2298/CSIS160620008J

DO - 10.2298/CSIS160620008J

M3 - Article

AN - SCOPUS:85021906473

SN - 1820-0214

VL - 14

SP - 347

EP - 367

JO - Computer Science and Information Systems

JF - Computer Science and Information Systems

IS - 2

ER -

R -tree for phase change memory

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this