Earticle

초록

영어

Recently, NAND-type flash memory has been regarded to be new promising storage media for large-scale database systems. For flash memory to be employed for that purpose, we need to reduce its expensive update cost caused by the inablity of in-place updates. To remedy such a drawback in flash memory, we propose a new flash-aware buffering scheme that enables virtual flushing of dirty pages. To this end, we slightly alter the tradional algorithms used for the logging scheme and buffer management scheme. By using the mechanism of virtual flushing, our proposed buffering scheme can efficiently prevent the frequenct occureces of page updates in flash storage. Besides the advantage of reduced page updates, the proposed viurtual flushing mechanism works favorably for shorneing a recocery time in the presense of failure. This is because it can reduce the time for redo actions during a recovry process. Owing to those two benefits, we can say that our scheme couble be very profitable when it is incorporated into cutting-edge flash-based database systems.

목차

Abstract
1. Introduction
2. Preliminaries
2.1. Previous Works
2.2 Idea Sketch
3. Proposed Flash-aware Buffering Scheme
3.1 Algorithm for Virtual Flushing
3.2 Algorithm for Reading a Page
3.3 Recovery Algorithm
4. Performance Evaluation
5. Conclusion
Acknowledgement
References

키워드

저자

• Seong-Chae Lim [ Professor, Dept. of Computer Science, Dongduk Women’s University, Korea ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Internet, Broadcasting and Communication

• 간기

  계간

• pISSN

  2288-4920

• eISSN

  2288-4939

• 수록기간

  2009~2025

• 십진분류

  KDC 326 DDC 380