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

A Survey of the Index Schemes based on Flash Memory  

Kim, Dong-Hyun (동서대학교 컴퓨터정보공학부)
Ban, Chae-Hoon (고신대학교 인터넷비즈니스학과)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.8, no.10, 2013 , pp. 1529-1534 More about this Journal
Abstract
Since a NAND-flash memory is able to store mass data in a small sized chip and consumes low power, it is exploited on various hand-held devices, such as a smart phone and a sensor node, etc. To process efficiently mass data stored in the flash memory, it is required to use an index. However, since the write operation of the flash memory is slower than the read operation and an overwrite operation is not supported, the usage of existing index schemes degrades the performance of the index. In this paper, we survey the previous researches of index schemes for the flash memory and classify the researches by the methods to solve problems. We also present the performance factor to be considered when we design the index scheme on the flash memory.
Keywords
Index; Flash Memory; Main Memory Buffer Scheme; Log Scheme; Index Tree;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 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, pp. 105-111, 2013.   과학기술학회마을   DOI   ScienceOn
2 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, pp. 1061-1066, 2012.   과학기술학회마을
3 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, pp. 1095-1101, 2012.   과학기술학회마을
4 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, pp. 409-430, 2003.
5 Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo, "An Efficient R-Tree Implementation over Flash-Memory Storage Systems", ACM Intl. Symp. on Advances in Geographic Info rmation Systems, ACM, pp. 17-24, 2003.
6 Junghyun Nam, Dong-Joo Park, "The Efficient Design and Implementation of the B-Tree on Flash Memory", Proc. of the 25th KISS Fall, pp. 55-57, 2005.
7 Hyun Seung Lee, Ha Yoon Song, Kyung- Chang Kim, "Performance of Index trees on Flash Memory", Intl. MultiConf. on Computer Science and Information Technology, pp. 725- 734, 2007.
8 Suman Nath, Aman Kansal, "FlashDB: Dynamic Self-tuning Database for NAND Flash", Intl. Conf. on Information Processing in Sensor Networks, pp. 410-419, 2007.
9 Devesh Agrawal, Deepak Genesan, Tamesh Sitaraman, Yanlei Diao, Shasho Singh, "Lazy- Adaptive Tree: An Optimized Index Structure for Flash Devices", Proc. of the VLDB Endowment, pp. 361-372, 2009.
10 Siwoo Byun, Moonhaeng Huh, Hoyoung Hwang, "An Index rewriting schemes using compression for flash memory database system", Journal of Information Science, pp. 1-18, 2007.
11 Yinan Li, Bingsheng He, Qiong Luo, Ke Yi, "Tree Indexing on Flash Disk", Proc. of ICDE, pp. 1303-1306, 2009.
12 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, pp. 149-167, 2011.