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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: International Conference on Management of Data, pp. 47–57. ACM (1984)
Park, C., Cheon, W., Kang, J., Roh, K., Cho, W., Kim, J.S.: A Reconfigurable FTL (flash translation layer) Architecture for NAND Flash-based Applications. ACM Trans. Embed. Comput. Syst. 7(4), 1–23 (2008)
Cho, H., Shin, D., Eom, Y.I.: Kast: K-associative Sector Translation for NAND Flash Memory in Real-time Systems. In: DATE 2009, pp. 507–512 (2009)
Gal, E., Toledo, S.: Algorithms and Data Structures for Flash Memories. ACM Computing Surveys 37 (2005)
Wu, C.H., Chang, L.P., Kuo, T.W.: An Efficient R-tree Implementation over Flash-memory Storage Systems. In: GIS, pp. 17–24. ACM (2003)
Nath, S., Kansal, A.: Flashdb: Dynamic Self-tuning Database for NAND Flash. In: IPSN, pp. 410–419. ACM (2007)
Wu, C.H., Kuo, T.W., Chang, L.P.: An Efficient B-tree Layer Implementation for Flash-memory Storage systems. ACM Trans. Embedded Comput. Syst. 6(3) (2007)
Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP Operations in Spatial Data Warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 443–459. Springer, Heidelberg (2001)
Pawlik, M., Macyna, W.: Implementation of the Aggregated R-tree over Flash Memory. Technical Report, Wroclaw University of Technology (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawlik, M., Macyna, W. (2012). Implementation of the Aggregated R-Tree over Flash Memory. In: Yu, H., Yu, G., Hsu, W., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29023-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-29023-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29022-0
Online ISBN: 978-3-642-29023-7
eBook Packages: Computer ScienceComputer Science (R0)