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.
- （社）電子情報通信学会の論文
- 2009-05-01
著者
-
Lee Yoon-joon
Department Of Computer Science Kaist
-
Ho Kim
Department Of Computer Science Kaist
-
YANG Chul-Woong
Department of Computer Science, KAIST
-
YONG LEE
Department of Computer Science, KAIST
-
Yang Chul-woong
Department Of Computer Science Kaist
-
Yong Lee
Department Of Computer Science Kaist
関連論文
- Accelerating Database Processing at Database-Driven Web Sites(Contents Technology and Web Information Systems)
- B208 ESTIMATION OF SPATIALLY VARYING THERMAL CONDUCTIVITY WITHOUT INTERNAL MEASUREMENTS(Gas turbine & forced convection heat transfer)
- Dynamic Forest : An Efficient Index Structure for NAND Flash Memory
- An Efficient Dynamic Hash Index Structure for NAND Flash Memory
- An Effective Self-Adaptive Admission Control Algorithm for Large Web Caches
- Concept Drift Detection for Evolving Stream Data
- SASUM: A Sharing-Based Approach to Fast Approximate Subgraph Matching for Large Graphs