Abstract
We present desiderata for improved I/O performance of spatial data structures over flash memory and hybrid flash-magnetic storage configurations. We target the organization of the data structures and the management of the in-memory buffer pool when dealing with spatial data. Our proposals are based on the fundamentals of flash memory, thereby increasing the likelihood of being immune to future trends.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Emrich, T., et al.: On the impact of flash SSDs on spatial indexing. In: DAMON 2010 (2010)
Kim, H., Ahn, S.: BPLRU: a buffer management scheme for improving random writes in flash storage. In: FAST (2008)
Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. Proc. VLDB Endow. 1(1), 514–525 (2008)
Park, S.-Y., et al.: CFLRU: a replacement algorithm for flash memory. In: CASES (2006)
Wu, C.-H., et al.: An efficient R-tree implementation over flash-memory storage systems. In: GIS (2003)
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
Koltsidas, I., Viglas, S.D. (2011). Spatial Data Management over Flash Memory. 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_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_28
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)