Browse > Article
http://dx.doi.org/10.13067/JKIECS.2015.10.2.275

Performance Evaluation of Fixed-Grid File Index on NAND Flash Memory  

Kim, Dong-Hyun (동서대학교 컴퓨터정보공학부)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.10, no.2, 2015 , pp. 275-282 More about this Journal
Abstract
Since a NAND-flash memory is able to keep data during electricity-off and has small cost to store data per bytes, it is widely used on hand-held devices. It is necessary to use an index in order to process mass data effectively on the flash memory. However, since the flash memory requires high cost for a write operation and does not support an overwrite operation, it is possible to reduce the performance of the index when the disk based index is exploited. In this paper, we implement the fixed grid file index and evaluate the performance of the index on various conditions. To do this, we measure the average processing time by the ratio of query operations and update operations. We also the compare the processing times of the flash memory with those of the magnetic disk.
Keywords
Index; Flash Memory; Fixed Grid File; Buffer Based Index; Non-buffer Based Index;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 Chil-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo, "An Efficient B-Tree Layer for Flash Memory Storage System," Real-Time and Embedded Computing Systems and Applications, LNCS 2968, Springer, 2003, pp. 409-430.
2 Junghyun Nam, Dong-Joo Park, "The Efficient Design and Implementation of the B-Tree on Flash Memory," Proc. of the 25th Korea Institute of Information Scientists and Engineers Fall, 2005, pp. 55-57.
3 Yong-Yoong Chai, "An Analog Content Addressable Memory implemented with a Winner-Tak-All Strategy," The Journal of the Korea Institute of Electronic Communication Sciences, vol. 8, no. 1, 2013, pp. 105-111.   과학기술학회마을   DOI   ScienceOn
4 Yong-Yoong Chai, "An Analog Memory Fabricated with Single-poly Nwell Process Technology," The Journal of the Korea Institute of Electronic Communication Sciences, vol. 7, no. 5, 2012, pp. 1061-1066.   과학기술학회마을   DOI
5 Chi-Yeon Kim, "A Range Query Method using index in Large-scale Database Systems," The Journal of the Korea Institute of Electronic Communication Sciences, vol. 7, no. 5, 2012, pp. 1095-1101.   과학기술학회마을   DOI
6 Hyun Seung Lee, Ha Yoon Song and Kyung-Chang Kim, "Performance of Index trees on Flash Memory," Intl. MultiConf. on Computer Science and Information Technology, 2007, pp. 725-734.
7 Siwoo Byun, Moonhaeng Huh, Hoyoung Hwang, "An Index rewriting schemes using compression for flash memory database system," Journal of Information Science, 2007, pp1-18.
8 Yinan Li, Bingsheng He, Qiong Luo, Ke Yi, "Tree Indexing on Flash Disk," Proc. of ICDE, 2009, pp. 1303-1306.
9 Mohamed Sarwat, Mohamed F. Mokbel, Xun Zhou, Suman Nath, "FAST : A Generic Framework for Flash-Aware Spatial Trees," Intl. Conf. on Advances in Spatial and Temporal Databases, 2011, pp. 149-167.