Browse > Article

Container-Based Record Management in Flash Memory Environment  

Bae, Duck-Ho (한양대학교 전자컴퓨터통신공학과)
Kim, Sang-Wook (한양대학교 전자컴퓨터통신공학과)
Chang, Ji-Woong (한국산업기술대학교 게임공학과)
Publication Information
Journal of KIISE:Databases / v.36, no.1, 2009 , pp. 1-7 More about this Journal
Abstract
Flash memory has its unique characteristics: i.e., (1) the write operation is much more costly than the read operation. (2) In-place updating is not allowed. In this paper, we first analyze how these characteristics affect the performance of record management in flash memory, and discuss the problems with previous methods for record management when they are applied to flash memory environment. Next, we propose a new record management method to be suitable for flash memory environment. The proposed method employs a new concept of a container that makes it possible to overwrite data on flash memory several times when performing insertions, deletions, and modifications of records. As a result, this method reduces the number of overwrite operations, and consequently does the number of erase operations. The results of experiments show that our method improves the performance by up to 34%, compared with the previous one.
Keywords
Flash memory DBMS; Record management method; Container;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 J. Jeong , S. Noh, S. Min and Y. Cho, 'A Design and Implementation of Flash Memory Simulator,' Journal of Korean Information Science: C, Vol.8, No.1, pp. 36-45, 2002   과학기술학회마을
2 S. Kim et al., 'A Development Framework for Reliable Flash Memory Software,' SK Telecommunications Review, Vol. l5, No.4, pp. 638-646, 2005
3 A. Kawaguchi, S. Nishioka, and H. Motoda, 'A Flash-Memory Based File System,' In Proc. USENIX Technical Conf, on Unix and Advanced Computing Systems, pp. 155-164, 1995
4 J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1995
5 Samsung, 2G NAND Flash Memory, http://www. samsung.com/products/semiconductor/NANDFlash/, 2008
6 J. Rao and K. Ross, 'Making $B^{+-}$Trees Cache Conscious in Main Memory,' In Proc. ACM Int'l. Conf on Management of Data, ACM SIGMOD, pp. 475-486, 2000   DOI   ScienceOn
7 E. Gal and S, Toledo, 'Algorithms and Data Structures for Flash Memories,' ACM Computing Surverys, Vol.37, No,2, pp. 138-163, 2005   DOI   ScienceOn
8 C. Wu, L. Chang, and T. Kuo, 'An Efficient B-Tree Layer for Flash-Memory Storage Systems,' In Proc. Int'l. Conf, on Real-Time and Embedded Computing Systems and Applications, RTCSA, Vol. LNCS 2968, pp. 409-430, 2003
9 K. Yim, 'A Novel Memory Hierarchy for Flash Memory Based Storage Systems,' Journal of Semiconductor Technology and Science, Vol.5, No.4, pp. 262-269, 2005   과학기술학회마을
10 S, Lee and B. Moon, 'Design of Flash-Based DBMS: An In-Page Logging Approach,' In Proc. ACM Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 55-66, 2007   DOI