Abstract
Spatial tree index structures are crucial components in spatial data management systems, designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing spatial tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Spatial Trees) as a generic framework for flash-aware spatial tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning spatial tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through smart memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
PostgreSQL, http://PostgreSQL, http://www.postgresql.org
Agrawal, D., Ganesan, D., Sitaraman, R.K., Diao, Y., Singh, S.: Lazy-adaptive tree: An optimized index structure for flash devices. In: PVLDB (2009)
Agrawal, N., Prabhakaran, V., Wobber, T., Davis, J., Manasse, M., Panigrahy, R.: Design Tradeoffs for SSD Performance. In: Usenix Annual Technical Conference, USENIX (2008)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD (1990)
Bouganim, L., Jónsson, B., Bonnet, P.: uFLIP: Understanding Flash IO Patterns. In: CIDR (2009)
Gray, J., Fitzgerald, B.: Flash Disk Opportunity for Server Applications. ACM Queue (2008)
Guttman, A.: R-Trees: A Dynamic Index Structure For Spatial Searching. In: SIGMOD (1984)
Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: VLDB (1995)
Katayama, N., Satoh, S.: The sr-tree: An index structure for high-dimensional nearest neighbor queries. In: SIGMOD (1997)
Kim, H., Ahn, S.: BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage. In: FAST (2008)
Lavenier, D., Xinchun, X., Georges, G.: Seed-based Genomic Sequence Comparison using a FPGA/FLASH Accelerator. In: ICFPT (2006)
Lee, S., Moon, B.: Design of Flash-Based DBMS: An In-Page Logging Approach. In: SIGMOD (2007)
Lee, S.-W., Moon, B., Park, C., Kim, J.-M., Kim, S.-W.: A case for Flash memory SSD in Enterprise Database Applications. In: SIGMOD (2008)
Lee, S.-W., Park, D.-J., sum Chung, T., Lee, D.-H., Park, S., Song, H.-J.: A Log Buffer-Based Flash Translation Layer Using Fully-Associate Sector Translation. In: TECS (2007)
Leventhal, A.: Flash Storage Today. ACM Queue (2008)
Li, Y., He, B., Luo, Q., Yi, K.: Tree indexing on Flash Disks. In: ICDE (2009)
Li, Y., He, B., Yang, R.J., Luo, Q., Yi, K.: Tree indexing on solid state drives. In: PVLDB, vol. 3(1) (2010)
Moshayedi, M., Wilkison, P.: Enterprise SSDs. ACM Queue (2008)
Nath, S., Gibbons, P.B.: Online Maintenance of Very Large Random Samples on Flash Storage. In: VLDB (2008)
Nath, S., Kansal, A.: Flashdb: Dynamic self-tuning database for nand flash. In: IPSN (2007)
Reinsel, D., Janukowicz, J.: Datacenter SSDs: Solid Footing for Growth (January 2008), http://www.samsung.com/us/business/semiconductor/news/downloads/210290.pdf
Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: VLDB (1987)
Shah, M.A., Harizopoulos, S., Wiener, J.L., Graefe, G.: Fast Scans and Joins using Flash Drives. In: International Workshop of Data Managment on New Hardware, DaMoN (2008)
White, D.A., Jain, R.: Similarity indexing with the ss-tree. In: ICDE (1996)
Wu, C., Chang, L., Kuo, T.: An Efficient R-tree Implementation over Flash-Memory Storage Systems. In: GIS (2003)
Wu, C., Kuo, T., Chang, L.: An Efficient B-tree Layer Implementation for Flash-Memory Storage Systems. In: TECS (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarwat, M., Mokbel, M.F., Zhou, X., Nath, S. (2011). FAST: A Generic Framework for Flash-Aware Spatial Trees. In: Pfoser, D., et al. Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22922-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22921-3
Online ISBN: 978-3-642-22922-0
eBook Packages: Computer ScienceComputer Science (R0)