Dynamic Forest: An Efficient Index Structure for NAND Flash Memory

In this paper, we present an efficient index structure for NAND flash memory, called the Dynamic Forest (D-Forest). Since write operations incur high overhead on NAND flash memory, D-Forest is designed to minimize write operations for index updates. The experimental results show that D-Forest significantly reduces write operations compared to the conventional B+-tree.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2009
Language
ENG
Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E92D, no.5, pp.1181 - 1185

ISSN
0916-8532
DOI
10.1587/transinf.E92.D.1181
URI
http://hdl.handle.net/10203/18564
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
Dynamic Forest An Efficient Index Structure for NAND Flash Memory.pdf(219.82 kB)Download
  • Hit : 163
  • Download : 232
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 1 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0