Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2005.12D.2.233

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree  

Im Sang-hyuk (코난테크놀로지)
Ku Kyong-I (한국전자통신연구원)
Kim Ki-chang (인하대학교 정보통신공학부)
Kim Yoo-Sung (인하대학교 정보통신공학부)
Publication Information
The KIPS Transactions:PartD / v.12D, no.2, 2005 , pp. 233-246 More about this Journal
Abstract
To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.
Keywords
다차원 색인 기법;노드 분할;중첩 최소화;라우팅 객체 선정;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, 'Generalized Search Trees for Database Systems,' Proc. of Int. Conf. on Very Large Databases(VLDB), pp.562-573, 1995
2 박만수 ,박철의, 김희린, 강경옥, 'Pitch 히스토그램을 이용한 내용기반 음악 정보 검색, ' 한국방송공학회, 방송공학회논문지, 제9권, 1호, pp.2-8, 2004   과학기술학회마을
3 N. Katayama and S. Satoh, 'The SR-tree: An Index Structure for High-Dimensional Nearest-Neighbor queries,' Proc. of Int. Conf. on ACM SIGMOD, pp.28-29, 1996
4 S. Berchtold, D. A. Keim, and H. P. Kriegel, 'The X-tree: An Index Structure for High-Dimensional Data,' VLDB Journal, 3(4), pp.517-542, 1996   DOI
5 J. K. Uhlmann, 'Satisfying General Proximity/Similarity Queries with Metric Trees,' Information Processing Letters, 40(1), pp.175-179, 1991   DOI   ScienceOn
6 T. Bozkaya and M. Ozsoyoglu, 'Distance-Based Indexing for High-Dimensional Metric Spaces,' Proc. of Int. Conf. on ACM SIGMOD, pp.357-368, 1997   DOI
7 P. Ciaccia, M. Patella, and P. Zezula, 'M-tree: An Efficient Access Method for Similarity Search in Metric spaces,' Proc. of Int. Conf. on Very Large Databases(VLDB), pp,426-435, 1997
8 E. Chavez, G. Navarro, R. Baeza-Yates, and J. Marroquin, 'Searching in Metric Spaces,' ACM Computing Surveys, 33(3), pp.273-321, 2001   DOI   ScienceOn
9 J. Han, M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, pp.349-354, 2001
10 V. Gaedes and O. Gunther, 'Multidimensional Access Methods,' Technical Report TR-96-043, International Computer Science Institute, Berkely, CA, pp.36-59, 1996
11 C. Traina Jr., A. Traina, C. Faloutsoss, and B. Seeger, 'Fast Indexing and Visualization of Metric Data Sets using Slim-Trees,' IEEE Transaction on Knowldege and Data Engineering, 14(2), pp.244-259, 2002   DOI   ScienceOn
12 C. Traina Jr., A. Traina, B. Seegar, and C. Faloutsos, 'Slim-tree: High Performance Metric Trees Minimizing Overlap Between Nodes,' Proc. of Int. Conf. on Extending Database Technology(EDBT), pp.51-65, 2000
13 N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, 'The R*-tree: An Efficient and Robust Access Method for Point and Rectangles,' Proc. of Int. Conf. on ACM SIGMOD, pp.322-331, 1990   DOI
14 D. A. White and R. Jain, 'Similarity Indexing with the SS-tree,' Proc. 12th Int. Conf. on Data Engineering(ICDE), pp.516-523, 1996   DOI
15 N. G. Colossi and M.A Nascimento, 'Benchmarking Access Structure for High-Dimensional Multimedia Data', TR-9905, Univ. of Alberta, 1999
16 E. Wood, T. Blum, D. Keislar, and J. Wheaton, 'Content-based Classification, Search, and Retrieval of Audio,' IEEE Multimedia, 3(3), pp.27-36, 1996   DOI   ScienceOn
17 R. Agrwal, C. Faloutsos, and A. Swami, 'Efficient Similarity Search in Sequence Databases,' Lecture Note in Computer Science, Springer-Verlag, Vol.730, pp.69-84, 1993   DOI   ScienceOn
18 C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, and R. Barber, 'Efficient and Effective Querying by Image Content,' Journal of Intelligent Information System, 3(3/4), pp.231-262, 1994   DOI
19 C. Faloutsos and K. I. Lin, 'FastMap: A Fast Algorithm for Indexing, Data-mining and Visualization of Traditional and Multimedia Databases,' Proc. of Int. Conf. on ACM SIGMOD, pp.163-174, 1995   DOI