An Efficient Dynamic Hash Index Structure for NAND Flash Memory
- Authors
- Yang, CW; Lee, KY; Kim, MH; Lee, YJ
- Issue Date
- Jul-2009
- Publisher
- IEICE
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E92A, no.7, pp 1716 - 1719
- Pages
- 4
- Journal Title
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- Volume
- E92A
- Number
- 7
- Start Page
- 1716
- End Page
- 1719
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/148038
- DOI
- 10.1587/transfun.E92.A.1716
- ISSN
- 0916-8508
1745-1337
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > 소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.