Implementation of the aggregated r-tree over flash memory

Authors:
Maciej Pawlik;Wojciech Macyna
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology, Wrocław, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wrocław, Poland
Venue:
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Year:
2012

Citing 8
Cited 0

R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient OLAP Operations in Spatial Data Warehouses

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
An efficient R-tree implementation over flash-memory storage systems

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Algorithms and data structures for flash memories

ACM Computing Surveys (CSUR)
FlashDB: dynamic self-tuning database for NAND flash

Proceedings of the 6th international conference on Information processing in sensor networks
An efficient B-tree layer implementation for flash-memory storage systems

ACM Transactions on Embedded Computing Systems (TECS)
A reconfigurable FTL (flash translation layer) architecture for NAND flash-based applications

ACM Transactions on Embedded Computing Systems (TECS)
KAST: K-Associative Sector Translation for NAND flash memory in real-time systems

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 to 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.