The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Survey of the Index Schemes based on Flash Memory

NAND 플래쉬메모리 기반 색인에 관한 연구

  • 김동현 (동서대학교 컴퓨터정보공학부) ;
  • 반재훈 (고신대학교 인터넷비즈니스학과)
  • Received : 2013.08.27
  • Accepted : 2013.10.21
  • Published : 2013.10.31
Download PDF
⟨ Previous Next ⟩

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.

NAND 플래쉬메모리는 적은 크기로 대용량의 데이터를 저장할 수 있고 전력소모량이 적기 때문에 스마트 폰, 센서노드 등의 다양한 휴대용기기에서 사용되어 진다. 플래쉬메모리에 저장된 대용량의 데이터를 효율적으로 처리하기 위하여 색인을 사용해야 한다. 그러나 쓰기 연산의 속도가 읽기 연산보다 매우 느리고 덮어쓰기를 지원하지 않기 때문에 기존의 색인을 사용하면 성능이 저하되는 문제가 발생한다. 이 논문에서는 플래쉬메모리의 특성을 이용하여 색인을 설계한 기존의 논문들을 살펴본다. 그리고 플래쉬메모리에서 색인을 설계할 때 고려해야할 성능요소를 제시한다.

Keywords

References

  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, pp. 409-430, 2003.
  2. 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.
  3. 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.
  4. 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.
  5. Suman Nath, Aman Kansal, "FlashDB: Dynamic Self-tuning Database for NAND Flash", Intl. Conf. on Information Processing in Sensor Networks, pp. 410-419, 2007.
  6. 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.
  7. 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.
  8. Yinan Li, Bingsheng He, Qiong Luo, Ke Yi, "Tree Indexing on Flash Disk", Proc. of ICDE, pp. 1303-1306, 2009.
  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, pp. 149-167, 2011.
  10. 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. https://doi.org/10.13067/JKIECS.2013.8.1.105
  11. 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.
  12. 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.