Browse > Article

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory  

Lee, Hyun-Seung (홍익대학교 컴퓨터공학과)
Song, Ha-Yoon (홍익대학교 컴퓨터공학과)
Kim, Kyung-Chang (홍익대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.14, no.8, 2008 , pp. 758-762 More about this Journal
Abstract
Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.
Keywords
Database; Nand Flash Memory; MR-Tree; Database Indexing Performance;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Kyung-Chang Kim and Suk-Woo Yun, MR-Tree : A cache-conscious main memory spatial index structure for mobile GIS, Web and wireless geographic information systems, The 4th international workshop (W2GIS 2004), pp. 167-180, 2004
2 Chin-Hsien Wu, Li-Pin Chang, and Tei-Wei Kuo, An efficient R-tree implementation over flash- memory storage systems, Proceeding of the 11th ACM international symposium on Advances in geographic information systems, 2003
3 Chanik Park, Jeong-Uk Kang, Seon-Yeong Park, and Jin-Soo Kim, Energy aware demand paging on Nand Flash-based embedded storages, Proceedings of IEEE/ACM ISLPED, 2004
4 SAMSUNG NAND flash SLC-small block, http:// www.samsung.com/global/business/semiconductor/productInfo.do?fmlyid=158&partnum=K9F1208R0C&&ppmi=1157, 2007
5 Chin-Hsien Wu, Li-Pin Chang, and Tei-Wei Kuo, An efficient B-tree layer for flash memory storage systems, The 9th international conference on Real-Time and Embedded Computing systems and Applications (RTCSA), 2003
6 남정현, 박동주, 플래시 메모리 상에서 B-트리 설계 및 구현, 정보과학회논문지, 제34권, 제2호, pp. 109-118, 2007   과학기술학회마을
7 Eran Gal and Sivan Toledo. Algorithms and data structures for flash memories, ACM Computing Surveys(CSUR), pp. 138-163, 2005