Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

M+-tree : A New Dynamical Multidimensional Index for Metric Spaces

Zhou, X., Wang, G., Yu, J.X. and Yu, G.

    In this paper, we propose a new metric index, called M+-tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+-tree takes full advantages of M-tree and MVP-tree, with a new concept called key dimension, which effectively reduces response time for similarity search. The main idea behind the key dimension is to make the fanout of tree larger by partitioning a subspace further into two subspaces, called twin-nodes. We can double the filtering effectiveness by utilizing the twin-nodes. In addition, for the purpose of ensuring high space utilization, we also conduct data reallocation between the twin nodes dynamically. Our experiment shows that higher filtering efficiency can be obtained by using the key dimensions for r-neighbor search and k-NN (k-nearest neighbor). We will report our experimental results in this paper.
Cite as: Zhou, X., Wang, G., Yu, J.X. and Yu, G. (2003). M+-tree : A New Dynamical Multidimensional Index for Metric Spaces. In Proc. Fourteenth Australasian Database Conference (ADC2003), Adelaide, Australia. CRPIT, 17. Schewe, K.-D. and Zhou, X., Eds. ACS. 161-168.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007