Implementation of the Aggregated R-Tree over Flash Memory

摘要

Flash memory becomes the very popular storage device. Almost every kind of hand-held devices use flash memory because of its shock - resistance, power economy and non-volatile nature. Recently more attention has been paid to the data storage in flash memory. Due lo the different architecture, the implementation of the B-tree and R-tree indexes on the solid discs cannot be applied to flash memory directly. In this paper we propose the efficient implementation of the aggregated R-tree index. In our approach we separate the R-tree meta data and the aggregated data into different sectors of flash memory. We also calculate the number of read and write operations and compare it with the standard R-tree implementation. Our proposition is particularly effective, since the R-tree structure is quite stable and the aggregated values change frequently. The experiments confirm the effectiveness of our implementations.