This paper proposed an efficient spatial Access method, called MDR-Tree (Mbr compression and Delayed write operation based R-Tree), that uses the node compression technique and the delayed write operation technique for flash memory embedded systems. The node compression technique of MDR-Tree increased the utilization of flash memory space by compressing the MBR of spatial data using relative coordinates and MBR size. Moreover, the delayed write operation technique reduced the number of write operations in flash memory by temporarily storing spatial data in the buffer and by reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer.
[1]
Antonin Guttman,et al.
R-trees: a dynamic index structure for spatial searching
,
1984,
SIGMOD '84.
[2]
Chanik Park,et al.
Cost-efficient memory architecture design of NAND flash memory embedded systems
,
2003,
Proceedings 21st International Conference on Computer Design.
[3]
Dong-Suk Hong,et al.
An Efficient Compression Technique for a Multi-dimensional Index in Main Memory
,
2007,
VISUAL.
[4]
Tei-Wei Kuo,et al.
An efficient R-tree implementation over flash-memory storage systems
,
2003,
GIS '03.
[5]
Siwoo Byun,et al.
An index rewriting scheme using compression for flash memory database systems
,
2007,
J. Inf. Sci..