A Compressed Hot-Cold Clustering to Improve Index Operation Performance of Flash Memory-SSD Systems

플래시메모리-SSD의 인덱스 연산 성능 향상을 위한 압축된 핫-콜드 클러스터링 기법

  • 변시우 (안양대학교 디지털미디어공학과)
  • Published : 2010.01.31


SSDs are one of the best media to support portable and desktop computers' storage devices. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for desktop and server computers. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of flash memory operations, as compared to RAM memory. In order to achieve this goal, we propose a new index management scheme based on a compressed hot-cold clustering called CHC-Tree. CHC-Tree-based index management improves index operation performance by dividing index nodes into hot or cold segments and compressing pointers and keys in the index nodes and clustering the hot or cold segments. The offset compression techniques using unused free area in cold index node lead to reduce the number of slow erase operations in index node insert/delete processes. Simulation results show that our scheme significantly reduces the write and erase operation overheads, improving the index search performance of B-Tree by up to 26 percent, and the index update performance by up to 23 percent.


  1. 임근수, 고건, "플래시 메모리 기반 저장장치의 설계기법", 정보과학회 추계 학술대회, 제30권 2-1호, pp. 274-276, 2003.10.
  2. Chanik Park, Jaeyu Seo,Dongyoung Seo, Shinhan Kim, and Bumsoo Kim, "Cost-Efficient Memory Architecture Design of NAND Flash Memory Embedded Systems", 21st International Conference on Computer Design, San Jose, California, pp. 474-479, 2003 October 13-15.
  3. 변시우, "하이브리드 하드디스크 시스템을 위한 플래시 노드 캐싱 기법", 한국산학기술학회논문지, 제 9권 6호, pp. 1696-1704, 2008.
  4. 성민영, "플래시 메모리 기반의 파일 저장 장치에 대한 성능분석", 제 9권 3호, 제 9권 6호, pp. 1696-1704, 2008.
  5. Cha S. K., J. H. Park, and B.D.Park, "Xmas: An Extensible Main-Memory Storage System," Proc. of 6th ACM Int'l Conference on Information and Knowledge Management, 1997.
  6. 황규영, 홍의경, 음두현, 박영철, 김진호, 데이터베이스 시스템, 생능출판사, 2000.
  7. B-tree, "B-tree", /B-tree, 2009.
  8. Beckmann N., H. P. Kriegel, R. Schneider, and B. Seeger, "The R*Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. of ACM SIGMOD Intl. Symp. on the Management of Data, pp. 322-331. 1990.
  9. 이창우, 안경환, 홍봉희 (2003), "이동체 데이터베이스를 위한 메인 메모리 색인의 성능 결정 요소에 관한 연구", 정보처리학회 춘계 학술대회 제10권 1호, pp. 1575-1578, 2003.5.
  10. Lehman T. J. and M. J. Carey, "A Study of Index Structures for Main Memory Database Management Systems", Proc. of 12th Intl. Conf. on Very Large Database, pp. 294-303, 1986.
  11. Hongjun Lu, Yuet Yeung Ng, and Zengping Tang, "T-Tree or B-Tree: Main Memory Database Index Structure Revisited", Proc. of 11th Australasian Database Conference, 2000.
  12. 정재용, 노삼혁, 민상렬, 조유근, 플래시 메모리 시뮬레이터의 설계 및 구현, 한국정보과학회 논문지 C-컴퓨팅의 실제, 제 8권 1호, pp. 36-45, 2002.
  13. Mesquite, "CSIM2.0",, 2008.
  14. Samsung, "SpinPoint T Series",, 2009.