An Efficient Dynamic Hash Index Structure for NAND Flash Memory

We propose an efficient dynamic hash index structure suitable for a NAND flash memory environment. Since write operations incur significant overhead in NAND flash memory, our design of index structure focuses on minimizing the number of write operations for hash index up dates. Through a set of extensive experiments, we show the effectiveness of the proposed hash index structure in a NAND flash memory environment.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2009-07
Language
ENG
Citation

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E92A, no.7, pp.1716 - 1719

ISSN
0916-8508
DOI
10.1587/transfun.E92.A.1716
URI
http://hdl.handle.net/10203/18559
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
An Efficient Dynamic Hash Index Structure for NAND Flash Memory.pdf(267.46 kB)Download
  • Hit : 214
  • Download : 455
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0