The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
ACM Computing Surveys (CSUR)
Database System Concepts
LGeDBMS: a small DBMS for embedded system with flash memory
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A superblock-based flash translation layer for NAND flash memory
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Efficient indexing data structures for flash-based sensor devices
ACM Transactions on Storage (TOS)
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
A transactional flash file system for microcontrollers
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A flash-memory based file system
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
ALS '01 Proceedings of the 5th annual Linux Showcase & Conference - Volume 5
A space-efficient flash translation layer for CompactFlash systems
IEEE Transactions on Consumer Electronics
μ-FTL:: a memory-efficient flash translation layer supporting multiple mapping granularities
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Soft lists: a native index structure for NOR-flash-based embedded devices
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
A B-Tree index extension to enhance response time and the life cycle of flash memory
Information Sciences: an International Journal
NANDFS: a flexible flash file system for RAM-constrained systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Adding aggressive error correction to a high-performance compressing flash file system
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
A self-adjusting flash translation layer for resource-limited embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
LazyFTL: a page-level flash translation layer optimized for NAND flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Log-compact R-tree: an efficient spatial index for SSD
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
A flexible OS-based approach for characterizing solid-state disk endurance
Proceedings of the 9th conference on Computing Frontiers
TL-Tree: flash-optimized storage for time-series sensing data on sensor platforms
Proceedings of the 27th Annual ACM Symposium on Applied Computing
HybridStore: an efficient data management system for hybrid flash-based sensor devices
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
A survey of address translation technologies for flash memories
ACM Computing Surveys (CSUR)
A group round robin based b-tree index storage scheme for flash memory devices
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
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.