Predefined clause-based structure to subdue blank node issues

2014 14th International Conference on Intelligent Systems Design and Applications ◽

10.1109/isda.2014.7066262 ◽

2014 ◽

Author(s):

Mary Ting ◽

Rabiah Abdul Kadir ◽

Azreen Azman ◽

Tengku Mohd Tengku Sembok ◽

Fatimah Ahmad

Keyword(s):

Blank Node

Download Full-text

R-Tree for phase change memory

Computer Science and Information Systems ◽

10.2298/csis160620008j ◽

2017 ◽

Vol 14 (2) ◽

pp. 347-367 ◽

Cited By ~ 2

Author(s):

Elkhan Jabarov ◽

Byung-Won On ◽

Gyu Choi ◽

Myong-Soon Park

Keyword(s):

Phase Change ◽

Spatial Data ◽

Processing Time ◽

Fill Factor ◽

Phase Change Memory ◽

Experimental Results ◽

Location Information ◽

Node Size ◽

Blank Node ◽

Change Memory

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.

Download Full-text