Journal of Information Science

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Register here to gain access to SAGE's 500+ Journals Online

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
0165551506076331v1
33/4/398    most recent
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Byun, S.
Right arrow Articles by Hwang, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?
This version was published on August 1, 2007
Journal of Information Science, Vol. 33, No. 4, 398-415 (2007)
DOI: 10.1177/0165551506076331

An index rewriting scheme using compression for flash memory database systems

Siwoo Byun

Department of Digital Media, Anyang University, Republic of Korea, swbyun{at}anyang.ac.kr

Moonhaeng Huh

Department of Digital Media, Anyang University, Republic of Korea

Hoyoung Hwang

Department of Media Engineering, Hansung University, Republic of Korea

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. F-Tree-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.

Key Words: tree indexing • portable devices • flash memory • mobile database • simulation


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?