Results 1 
3 of
3
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 652 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion of objects and split management, whF h keep th Mtree always balanced  severalheralvFV split alternatives are considered and experimentally evaluated. Algorithd for similarity (range and knearest neigh bors) queries are also described. Results from extensive experimentationwith a prototype system are reported, considering as th performance criteria th number of page I/O's and th number of distance computations. Th results demonstratethm th Mtree indeed extendsth domain of applicability beyond th traditional vector spaces, performs reasonably well inhE[94Kv#E44V[vh data spaces, and scales well in case of growing files. 1
Mb+Tree: A New Index Structure For Multimedia Databases
 Proc. of the International Workshop on MultiMedia Database
, 1995
"... We describe a new indexing structure, named the MB + tree which has been designed to assist contentbased retrieval in image and video databases. We initially consider the types of queries that would be prevalent in such databases and map them to nearestneighbor searches and range searches in a ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We describe a new indexing structure, named the MB + tree which has been designed to assist contentbased retrieval in image and video databases. We initially consider the types of queries that would be prevalent in such databases and map them to nearestneighbor searches and range searches in a multidimensional space. The MB + tree is based on linear order in a high dimensional space and has several features of the standard B + tree. The linear order gives it many advantages over other structures which are commonly used for indexing in multidimensional space. Specifically, the algorithm for finding nearestneighbors is efficient and flexible as it optimally finds the subtrees which can contain the desired point(s) while allowing the use of different weighted euclideandistance similarity measures. It is expected that the projected advantages of the MB + tree will be confirmed by experimental results. 1 Introduction With the proliferation of multimedia data, it is becom...
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access method, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a distance function satisfying the positivity, symmetry, and triangle inequality postulates. We detail algorithms for i ..."
Abstract
 Add to MetaCart
A new access method, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a distance function satisfying the positivity, symmetry, and triangle inequality postulates. We detail algorithms for insertion of objects and split management, which keep the Mtree always balanced  several heuristic split alternatives are considered and experimentally evaluated. Algorithms for similarity (range and knearest neighbors) queries are also described. Results from extensive experimentation with a prototype system are reported, considering as the performance criteria the number of page I/O's and the number of distance computations. The results demonstrate that the Mtree indeed extends the domain of applicability beyond the traditional vector spaces, performs reasonably well in highdimensional data spaces, and scales well in case of growing files.