Spatial Data Management over Flash Memory

  • Ioannis Koltsidas
  • Stratis D. Viglas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6849)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Emrich, T., et al.: On the impact of flash SSDs on spatial indexing. In: DAMON 2010 (2010)Google Scholar
  2. 2.
    Kim, H., Ahn, S.: BPLRU: a buffer management scheme for improving random writes in flash storage. In: FAST (2008)Google Scholar
  3. 3.
    Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. Proc. VLDB Endow. 1(1), 514–525 (2008)CrossRefGoogle Scholar
  4. 4.
    Park, S.-Y., et al.: CFLRU: a replacement algorithm for flash memory. In: CASES (2006)Google Scholar
  5. 5.
    Wu, C.-H., et al.: An efficient R-tree implementation over flash-memory storage systems. In: GIS (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ioannis Koltsidas
    • 1
  • Stratis D. Viglas
    • 2
  1. 1.IBM ResearchZurichSwitzerland
  2. 2.School of InformaticsUniversity of EdinburghUK

Personalised recommendations