Flash Memory Lock Management for Portable Information Systems

Byun, Siwoo; Huh, Moon-Haeng; Hwang, Hyeon‐Jong

doi:10.1142/s0218843006001438

Cited by 5 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[11] Recently, flash memory has become a critical component in building embedded systems or portable devices because of its non-volatile, shock-resistant, and power-economic nature. Its density and I/O performance have been improved to a level at which it can be used not only as a main storage for portable information systems [6,7] but also as a cache memory for hybrid database storages [2,4,18]. Although flash memory is not as fast as RAM, it is a hundred times faster than a hard disk in data access operations.…”

Section: Introductionmentioning

confidence: 99%

Enhanced Index Management for Accelerating Hybrid Storage Systems

Byun¹

2009

JCIT

View full text Add to dashboard Cite

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index management scheme called HB +-Tree. HB +-Tree-based index management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

show abstract

Section: Introductionmentioning

confidence: 99%

Enhanced Index Management for Accelerating Hybrid Storage Systems

Byun¹

2009

JCIT

View full text Add to dashboard Cite

show abstract

“…In recent years, flash memory has been widely used in various embedded computing systems and portable devices such as PDAs (personal digital assistants), HPCs (handheld PCs), MP3 players and mobile phones because of its small size, shock-resistance, low-power consumption and non-volatile properties [4,8]. There are mainly two types of flash memories: NOR and NAND.…”

Section: Introductionmentioning

confidence: 99%

A reliable B-tree implementation over flash memory

Xiang

Yue

Liu

et al. 2008

Proceedings of the 2008 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Flash memory has been widely used in various embedded computing systems and portable devices in recent years because of its small size, shock-resistance, low-power consumption and non-volatile properties. To hide the disadvantages of flash memory such as out-of-place update, a flash translation layer (FTL) is usually used for providing transparent block-device emulation. But when index structures are implemented over FTL, intensive overwrite operations caused by record inserting, deleting, modifying and index reorganizing could not only degrade the performance significantly but also reduce the life of flash memory. To address the problem, BFTL and IBSF are proposed. However, neither of them could avoid the loss of records and incompatibilities when system crash occurs. In this paper, a reliable B-tree implementation called RBFTL is presented for flash-memory storage systems. It is placed between the application layer and FTL. RBFTL could minimize the loss of data and eliminate incompatibilities effectively and efficiently when system crashes. The experimental results also show that RBFTL yields a better performance than FTL. *

show abstract

“…Each information device could include several applications such as information management tools and a small database. Flash memory is one of the best candidates supporting the use of small information devices for data management in portable computing environments [1].…”

Section: Introductionmentioning

confidence: 99%

An index rewriting scheme using compression for flash memory database systems

Byun

Huh

Hwang

2007

Journal of Information Science

Self Cite

View full text Add to dashboard Cite

Flash memories are one of the best media to support portable computers' storage areas in mobile database environments. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for portable computers. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of flash operations, as compared to RAM memory. In order to achieve this goal, we propose a new index rewriting scheme based on a compressed index called F-Tree. FTree-based index management improves index operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes. Based on the results of the performance evaluation, we conclude that the F-Tree-based scheme outperforms the traditional schemes.

show abstract

Flash Memory Lock Management for Portable Information Systems

Cited by 5 publications

References 4 publications

Enhanced Index Management for Accelerating Hybrid Storage Systems

Enhanced Index Management for Accelerating Hybrid Storage Systems

A reliable B-tree implementation over flash memory

An index rewriting scheme using compression for flash memory database systems

Contact Info

Product

Resources

About