Article

μ-tree: an ordered index structure for NAND flash memory

Authors:

Jin-Soo KimAuthors Info & Claims

EMSOFT '07: Proceedings of the 7th ACM & IEEE international conference on Embedded software

Pages 144 - 153

https://doi.org/10.1145/1289927.1289953

Published: 30 September 2007 Publication History

Abstract

As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management systems are being built on it. They require an efficient index structure to locate a particular item quickly from a huge amount of directory entries or database records. This paper proposes μ-Tree, a new ordered index structure tailored to the characteristics of NAND flash memory. μ-Tree is a balanced tree similar to B+-Tree. In μ-Tree, however, all the nodes along the path from the root to the leaf are put together into a single flash memory page in order to minimize the number of flash write operations when a leaf node is updated. Our experimental evaluation shows that μ-Tree outperforms B+-Tree by up to 28% for traces extracted from real workloads. With a small in-memory cache of 8 Kbytes, μ-Tree improves the overall performance by up to 90% compared to B+-Tree with the same cache size.

References

[1]

A. Kawaguchi et al. A Flash-Memory Based File System. In Proc. of the 1995 Winter USENIX Conference, pages 155--164, 1995.

Digital Library

[2]

Aleph One Limited. Yet Another Flash File System (YAFFS). http://www.aleph1.co.uk/yaffs.

[3]

R. Bayer and E. McCreight. Organization and Maintenance of Large Ordered Indexes. Acta Infomatica, 1(3):173--189, 1972.

Digital Library

[4]

A. B. Bityutskiy. JFFS3 design issues. http://www.linux-mtd.infradead.org.

[5]

C. H. Wu et al. An Efficient B-Tree Layer for Flash Memory Storage Systems. In Proc. of Int. Conf. on Real-Time and Embedded Computing Systems and Applications (RTCSA), 2003.

[6]

D. Comer. Ubiquitous B-Tree. ACM Computing Surveys, 11(2):121--137, 1979.

Digital Library

[7]

E. Gal and S. Toledo. A Transactional Flash File System for Microcontrollers. In Proc. of the USENIX Annual Technical Conference, 2005.

Digital Library

[8]

J. Gray and G. Graefe. The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. ACM SIGMOD Record, 26(4):63--68, 1997.

Digital Library

[9]

G.-J. Kim et al. LGeDBMS: A Small DBMS for Embedded System with Flash Memory. In Proc. of the 32nd Int. Conf. on Very Large Data Bases (VLDB), pages 1255--1258, 2006.

Digital Library

[10]

J. Kim et al. A Space Efficient Flash Translation Layer for CompactFlash Systems. IEEE Trans. Consumer Electronics, 48(2):366--375, May 2002.

Digital Library

[11]

J.-U. Kang et al. A Superblock-based Flash Translation Layer for NAND Flash Memory. In Proc. of Int. Conf. on Embedded Systems Software (EMSOFT), 2006.

Digital Library

[12]

Microsoft Corp. SQL Server 2005. http://www.microsoft.com/sql/default.mspx.

[13]

S. Nath and A. Kansal. FlashDB: Dynamic Self-Tuning Database for NAND Flash. In Proc. of Int. Conf. on Information Processing in Sensor Networks (IPSN), 2007.

Digital Library

[14]

Oracle Corp. Oracle 10g. http://www.oracle.com/database/index.html.

[15]

D. Philips. A Directory Index for Ext2. In Proc. of the 2001 Annual Linux Showcase and Conference, 2001.

Digital Library

[16]

R. Quinnell. Multi-Level Cell NAND Flash. http://www.edn.com/article-partner/CA503389.html, Feb. 2005.

[17]

H. Reiser. Reiser File System. http://www.namesys.com.

[18]

M. Rosenblum and J. K. Ousterhout. The Design and Implementation of A Log-Structured File System. ACM Trans. Computer Systems, 10(1):26--52, 1992.

Digital Library

[19]

S. Lin et al. Efficient Indexing Data Structures for Flash-Based Sensor Devices. ACM Trans. Storage, 2(4):468--503, November 2006.

Digital Library

[20]

Samsung Elec. 2Gx8 Bit NAND Flash Memory (K9GAG08U0M-P). 2006.

[21]

Samsung Elec. 2Gx8 Bit NAND Flash Memory (K9WAG08U1A). 2006.

[22]

A. Silberschatz, H. Korth, and S. Sudarshan. Database System Concept. 4th edition, 2002.

Digital Library

[23]

M. Slocombe. Samsung CEO: NAND Flash Will Replace Hard Drives. http://digital-lifestyles.info/display page.asp?section=platforms&id=2573, Sep. 2005.

[24]

D. Woodhouse. JFFS: The Journalling Flash File System. In Proc. of the Ottawa Linux Symposium, 2001.

Cited By

Huang PLin THuang P(2022)Extendable B-tree on Multi-channel Nonvolatile Memory Devices2022 IEEE 5th International Conference on Knowledge Innovation and Invention (ICKII )10.1109/ICKII55100.2022.9983552(119-125)Online publication date: 22-Jul-2022
https://doi.org/10.1109/ICKII55100.2022.9983552
He QBian GZhang WWu FLi Z(2021)TCFTL: Improved Real-Time Flash Memory Two Cache Flash Translation Layer AlgorithmJournal of Nanoelectronics and Optoelectronics10.1166/jno.2021.297016:3(403-413)Online publication date: 1-Mar-2021
https://doi.org/10.1166/jno.2021.2970
Liu TZhang WXu TWang G(2019)Research and Analysis of Design and Optimization of Magnetic Memory Material Cache Based on STT-MRAMKey Engineering Materials10.4028/www.scientific.net/KEM.815.28815(28-34)Online publication date: Aug-2019
https://doi.org/10.4028/www.scientific.net/KEM.815.28
Show More Cited By

Index Terms

μ-tree: an ordered index structure for NAND flash memory
1. Information systems
  1. Information retrieval
    1. Document representation
    2. Search engine architectures and scalability
      1. Search engine indexing
  2. Information storage systems
    1. Record storage systems
      1. Directory structures

Recommendations

μ*-Tree: An Ordered Index Structure for NAND Flash Memory with Adaptive Page Layout Scheme

As NAND flash memory is gaining popularity as a storage medium for mobile embedded devices, many flash-aware file systems, flash-aware DBMSes, and flash translation layers (FTLs) require an flash-efficient index structure. This paper proposes a novel ...
Optimizing B+-tree for hybrid storage systems

Flash-memory-based solid state drives (SSD) have been widely used in computer systems. Due to the high price and some specific features of SSD such as asymmetric read/write speeds and limited erasure endurance, it has been a very common solution, e.g., ...
PB⁺-Tree: PCM-Aware B⁺-Tree
Phase change memory (PCM) is non-volatile memory that is byte-addressable. It is two to four times denser than DRAM, orders of magnitude better than NAND Flash memory in read latency, and 10 times better than NAND Flash memory in write endurance. However, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

EMSOFT '07: Proceedings of the 7th ACM & IEEE international conference on Embedded software

September 2007

304 pages

ISBN:9781595938251

DOI:10.1145/1289927

Program Chairs:
Christoph M. Kirsch
University of Salzburg
,
Reinhard Wilhelm
Saarland University

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 September 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ESWEEK07

Sponsor:

ESWEEK07: Third Embedded Systems Week

September 30 - October 3, 2007

Salzburg, Austria

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

64
Total Citations
View Citations
1,094
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Huang PLin THuang P(2022)Extendable B-tree on Multi-channel Nonvolatile Memory Devices2022 IEEE 5th International Conference on Knowledge Innovation and Invention (ICKII )10.1109/ICKII55100.2022.9983552(119-125)Online publication date: 22-Jul-2022
https://doi.org/10.1109/ICKII55100.2022.9983552
He QBian GZhang WWu FLi Z(2021)TCFTL: Improved Real-Time Flash Memory Two Cache Flash Translation Layer AlgorithmJournal of Nanoelectronics and Optoelectronics10.1166/jno.2021.297016:3(403-413)Online publication date: 1-Mar-2021
https://doi.org/10.1166/jno.2021.2970
Liu TZhang WXu TWang G(2019)Research and Analysis of Design and Optimization of Magnetic Memory Material Cache Based on STT-MRAMKey Engineering Materials10.4028/www.scientific.net/KEM.815.28815(28-34)Online publication date: Aug-2019
https://doi.org/10.4028/www.scientific.net/KEM.815.28
Qu WWang XLi JLi X(2019)Hybrid Indexes by Exploring Traditional B-Tree and Linear RegressionWeb Information Systems and Applications10.1007/978-3-030-30952-7_61(601-613)Online publication date: 16-Sep-2019
https://doi.org/10.1007/978-3-030-30952-7_61
Guo JMin CCai TChen Y(2017)Improving Write Performance and Extending Endurance of Object-Based NAND Flash DevicesACM Transactions on Embedded Computing Systems10.1145/310592417:1(1-26)Online publication date: 14-Nov-2017
https://dl.acm.org/doi/10.1145/3105924
Roh HShin MJung WPark S(2017)Advanced Block Nested Loop Join for Extending SSD LifetimeIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2017.265180329:4(743-756)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TKDE.2017.2651803
KIM SCHOI JKWAK J(2016)PBGC: Proxy Block-Based Garbage Collection for Index Structures in NAND Flash MemoryIEICE Transactions on Information and Systems10.1587/transinf.2015EDL8144E99.D:7(1928-1932)Online publication date: 2016
https://doi.org/10.1587/transinf.2015EDL8144
Guo JMin CCai TChen Y(2016)A design to reduce write amplification in object-based NAND flash devicesProceedings of the Eleventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis10.1145/2968456.2968465(1-10)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1145/2968456.2968465
Jin PYang CJensen CYang PYue L(2016)Read/write-optimized tree indexing for solid-state drivesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-015-0406-125:5(695-717)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s00778-015-0406-1
Wang JLam KChang YHsieh JHuang P(2015)Block-Based Multi-Version B$^+$ -Tree for Flash-Based Embedded Database SystemsIEEE Transactions on Computers10.1109/TC.2014.230821364:4(925-940)Online publication date: Apr-2015
https://doi.org/10.1109/TC.2014.2308213
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents