blank node
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2020 ◽  
Vol 46 (6) ◽  
pp. 384-396
Author(s):  
D. S. Razd’yakonov ◽  
A. V. Morozov ◽  
D. S. Pavlov ◽  
D. I. Muromtsev

2017 ◽  
Vol 14 (2) ◽  
pp. 347-367 ◽  
Author(s):  
Elkhan Jabarov ◽  
Byung-Won On ◽  
Gyu Choi ◽  
Myong-Soon Park

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.


2016 ◽  
Vol 50 (2) ◽  
pp. 505-542 ◽  
Author(s):  
Christina Lantzaki ◽  
Panagiotis Papadakos ◽  
Anastasia Analyti ◽  
Yannis Tzitzikas
Keyword(s):  

Author(s):  
Mary Ting ◽  
Rabiah Abdul Kadir ◽  
Azreen Azman ◽  
Tengku Mohd Tengku Sembok ◽  
Fatimah Ahmad
Keyword(s):  

Author(s):  
Yannis Tzitzikas ◽  
Christina Lantzaki ◽  
Dimitris Zeginis

Sign in / Sign up

Export Citation Format

Share Document