DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Chul-Woong | ko |
dc.contributor.author | Lee, Ki Yong | ko |
dc.contributor.author | Kim, Myoung Ho | ko |
dc.contributor.author | Lee, Yoon Joon | ko |
dc.date.accessioned | 2010-05-26T02:11:02Z | - |
dc.date.available | 2010-05-26T02:11:02Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E92D, no.5, pp.1181 - 1185 | - |
dc.identifier.issn | 0916-8532 | - |
dc.identifier.uri | http://hdl.handle.net/10203/18564 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.title | Dynamic Forest: An Efficient Index Structure for NAND Flash Memory | - |
dc.type | Article | - |
dc.identifier.wosid | 000266425700042 | - |
dc.identifier.scopusid | 2-s2.0-77950330301 | - |
dc.type.rims | ART | - |
dc.citation.volume | E92D | - |
dc.citation.issue | 5 | - |
dc.citation.beginningpage | 1181 | - |
dc.citation.endingpage | 1185 | - |
dc.citation.publicationname | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | - |
dc.identifier.doi | 10.1587/transinf.E92.D.1181 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Myoung Ho | - |
dc.contributor.localauthor | Lee, Yoon Joon | - |
dc.contributor.nonIdAuthor | Lee, Ki Yong | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | NAND flash memory | - |
dc.subject.keywordAuthor | D-Forest | - |
dc.subject.keywordAuthor | index structure | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.