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

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

DOI QR Code

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

NAND 플래쉬메모리에서 고정그리드화일 색인의 성능 평가

  • 김동현 (동서대학교 컴퓨터정보공학부)
  • Received : 2014.11.20
  • Accepted : 2015.02.09
  • Published : 2015.02.28
Download PDF
⟨ Previous Next ⟩

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.

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, 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. https://doi.org/10.13067/JKIECS.2013.8.1.105
  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. https://doi.org/10.13067/JKIECS.2012.7.5.1061
  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. https://doi.org/10.13067/JKIECS.2012.7.5.1095
  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.