Browse > Article

An Implementation of Efficient M-tree based Indexing on Flash-Memory Storage System  

Yu, Jeong-Soo (서강대학교 컴퓨터공학과)
Nang, Jong-Ho (서강대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.16, no.1, 2010 , pp. 70-74 More about this Journal
Abstract
As the storage capacity of the flash memories increased portable devices began to store mass amount of multimedia data on flash memory. Therefore, there has been a need for an effective data management scheme by indexing structure. Among many indexing schemes, M-tree is well known for it's suitability for multimedia data with high dimensional matrix space. Since flash memories have writing operation restriction, there is a performance limitation in indexing scheme with frequent write operation. In this paper, a new node split method with reduced write operation for m-tree indexing scheme in flash memory is proposed. According to experiments the proposed method reduced the write operation to about 7% of the original method. The proposed method will effectively construct an indexing structure for multimedia data in flash memories.
Keywords
Flash Memory; Indexing; M-tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Yianilos, P. N., "Excluded middle vantage point forests for nearest neighbor search," Tech. rep., NEC Research Institute, 1999. Presented at the Sixth DIMACS Implementation Challenge: Near Neighbor Searches workshop, Jan. 1999.
2 P. Ciaccia, M. Patella, F. Rabitti, and P. Zezula, "Indexing metric spaces with M-tree," in Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997), pp. 426-435, 1997.
3 C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos, "Slim-trees: High performance metric trees minimizing overlap between nodes," in proceedings 7th EDBT 2000, pp.51-65, 2000.
4 X. Zhou, G. Wang, J.Y. Xu, G. Yu, "M+-tree: A new dynamical multidimensional index for metric spaces," in Proceedings of the 14th Australasian Database Conference (ADC'03), pp.161-168, 2003.
5 Siwoo Byun, "F-Tree：Flash Memory based Indexing Scheme for Portable Information Devices," in Proceedings Journal of Information Technology Applications & Management, vol.13, no.4, pp. 257-271, 2006.
6 A. B. Bityutskiy. JFFS3 design issues. http://www. linux-mtd.infradead.org.
7 Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo, "An efficient r-tree implementation over flash-memory storage systems," in Proceedings of the 11th ACM international symposium on Advances in geographic information systems, pp.17-24, 2003.
8 T. Bozkaya and Z. M. Ozsoyoglu, "Distance-based indexing for high-dimensional metric spaces," in Proceedings of ACM-SIGMOD international conference on Management of data, pp.357-368, 1997.
9 D. Kang, D. Jung, J.-U. Kang, and J.-S. Kim, "${\mu}-tree:$ an ordered index structure for nand flash memory," in Proceedings of the 7th ACM & IEEE international conference on Embedded software (EMSOFT '07), pp.144-153, 2007
10 K. Han-Joon and L. Sang-goo, "A new flash memory management for flash storage system," in Proceedings of the Computer Software and Applications Conference (COMPSAC 1999), pp.284-289, 1999.
11 P. N. Yianilos, "Data structures and algorithms for nearest neighbor search in general metric spaces," in Proceedings of Fourth Annu. ACM-SIAM Symp. Discrete Algorithms, pp.311-321, 1993.
12 Samsung Electronics. Nand flash memory & smartmedia data book, 2004.