원문정보
F-Tree:Flash Memory based Indexing Scheme for Portable Information Devices
초록
영어
Recently, flash memories are one of best media to support portable computer"s storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes. Based on the results of the performance evaluation, we conclude that F-Tree indexing scheme outperforms the traditional indexing scheme.
목차
1. 서론
2. 관련 연구
3. 플래시 메모리의 특성을 고려한 색인 저장 및 관리 기법 제안
3.1 제안 배경
3.2 플래시 메모리 기반 색인 저장기법의 제안
4. 시뮬레이션 및 성능 평가
4.1 실험용 트리 샘플의 구성
4.2 모의실험 환경의 구성
4.3 실험 결과 및 분석
5. 결론 및 향후 과제
참고문헌