초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

Recently, NAND Flash memory has become an alternative storage system for a storage device because of its rapid access speed, shock-resistant, small size and lower power consumption. However, compared to the disk-based storage device, NAND flash memory has several hardware limitations such as asymmet...

Recently, NAND Flash memory has become an alternative storage system for a storage device because of its rapid access speed, shock-resistant, small size and lower power consumption. However, compared to the disk-based storage device, NAND flash memory has several hardware limitations such as asymmetric speed of read, write and erase operation and no in-place update, so that hash index structure, one of the popular disk-based index structure, may result in severe performance degradation if it is directly deployed on NAND flash memory. Especially, frequent insertion, deletion, and update operations lead to an enormous amount of in-place update operations that invoke a number of slow write operations and erase operations, hence result in performance degradation. In this paper, we propose a new index structure that delays a split operation which causes additional write and erase operations by using overflow buckets when bucket overflow occurs rather than immediate invocation of split operations. Also, we present a new overflow bucket maintenance policy that can reduce the number of additional read/write operations by adaptively handling the number of overflow buckets according to the update/erase ratio for each bucket. Finally, we show the superiority of the proposed index structure by comparing it to traditional extendible hash index through mathematical analysis and various experiments.

주제어