Skip to main content
SpringerLink
Log in

Issues of Flash-Aware Buffer Management for Database Systems

  • Conference paper
Data Security and Security Data (BNCOD 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6121))

Included in the following conference series:

  • 903 Accesses

Abstract

Classical buffer replacement policies, e.g., LRU, are suboptimal for database systems having flash disks for persistence, because they are not aware of the distinguished characteristics of those storage devices. We discuss the basic principles of flash-aware algorithms and issues related to transaction management. An efficient flash-aware algorithm, CFDC, is presented and compared to several previous proposals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gray, J., Fitzgerald, B.: Flash disk opportunity for server applications. ACM Queue 6(4), 18–23 (2008)

    Article  Google Scholar 

  2. Bouganim, L., Jónsson, B.T., Bonnet, P.: uFLIP: Understanding flash IO patterns. In: CIDR (2009)

    Google Scholar 

  3. Ou, Y., Härder, T., Jin, P.: CFDC: a flash-aware replacement policy for database buffer management. In: DaMoN, pp. 15–20. ACM, Providence (2009)

    Chapter  Google Scholar 

  4. Härder, T., Reuter, A.: Principles of transaction-oriented database recovery. ACM Computing Surveys 15(4), 287–317 (1983)

    Article  Google Scholar 

  5. Park, S., Jung, D., et al.: CFLRU: a replacement algorithm for flash memory. In: CASES, pp. 234–241 (2006)

    Google Scholar 

  6. Jung, H., Shim, H., et al.: LRU-WSR: integration of LRU and writes sequence reordering for flash memory. Trans. on Cons. Electr. 54(3), 1215–1223 (2008)

    Article  Google Scholar 

  7. Tanenbaum, A.S.: Operating Systems, Design and Impl. Prentice-Hall (1987)

    Google Scholar 

  8. Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. VLDB Endow. Arch. 1, 514–525 (2008)

    Article  Google Scholar 

  9. Seo, D., Shin, D.: Recently-evicted-first buffer replacement policy for flash storage devices. Trans. on Cons. Electr. 54(3), 1228–1235 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kaiserslautern, Germany

    Yi Ou & Theo Härder

Authors
  1. Yi Ou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Theo Härder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Mathematical Sciences, Old Royal Naval College, University of Greenwich, Park Row, Greenwich, SE10 9LS, London, UK

    Lachlan M. MacKinnon

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ou, Y., Härder, T. (2012). Issues of Flash-Aware Buffer Management for Database Systems. In: MacKinnon, L.M. (eds) Data Security and Security Data. BNCOD 2010. Lecture Notes in Computer Science, vol 6121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25704-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25704-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25703-2

  • Online ISBN: 978-3-642-25704-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation