Skip to main content

B-Tree Index Layer for Multi-channel Flash Memory

  • Conference paper
  • First Online:
Mobile and Wireless Technologies 2017 (ICMWT 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 425))

Included in the following conference series:

Abstract

Most of the recent studies on flash-aware index design focused mainly on the single channel flash memory where parallel processing of the B-tree index is not a consideration. This paper discusses efficient indexing on multi-channel flash storage and proposes a B-tree storage scheme, which not only exploits internal parallelisms of the underlying storage structure and also adjusts the node storage dynamically based on the run-time workload. Experimental results show that the proposed B-tree index layer is capable of speed up index operations near linearly while increasing degrees of internal parallelisms of flash memory.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Park K-T et al (2015) Three-dimensional 128 Gb MLC vertical NAND flash memory with 24-WL stacked layers and 50 MB/s high-speed programming. IEEE J Solid-State Circ 50(1):204–213

    Article  Google Scholar 

  2. Chung T-S et al (2009) A survey of flash translation layer. J Syst Archit Embed Syst Des 55:332–343

    Article  Google Scholar 

  3. Na G et al (2012) Dynamic in-page logging for B + -tree index. IEEE Trans Knowl Data Eng 24(7):1231–1243

    Article  Google Scholar 

  4. Kim J et al (2012) Parameter-aware I/O management for solid state disks (SSDs). IEEE Trans Comput 61(5):636–649

    Article  MathSciNet  Google Scholar 

  5. Roh H et al (2011) B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives. In: Proceedings of VLDB’11, vol 5(4), pp 286–297

    Google Scholar 

  6. Jin R et al (2014) A group round robin based b-tree index storage scheme for flash memory devices. In: Proceedings of the IMCOM’14, January 9–11, 2014, Siem Reap, Cambodia

    Google Scholar 

Download references

Acknowledgments

This research was supported by the MISP(Ministry of Science, ICT & Future Planning), Korea, under the National Program for Excellence in SW) supervised by the IITP(Institute for Information & communications Technology Promotion)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rize Jin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media Singapore

About this paper

Cite this paper

Jin, R. (2018). B-Tree Index Layer for Multi-channel Flash Memory. In: Kim, K., Joukov, N. (eds) Mobile and Wireless Technologies 2017. ICMWT 2017. Lecture Notes in Electrical Engineering, vol 425. Springer, Singapore. https://doi.org/10.1007/978-981-10-5281-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5281-1_21

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5280-4

  • Online ISBN: 978-981-10-5281-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics