Sciweavers

89 search results - page 1 / 18
» Indexing Metric Spaces with M-Tree
Sort
View
ADC
2003
Springer
127views Database» more  ADC 2003»
13 years 10 months ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
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 advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu
DEXA
2010
Springer
187views Database» more  DEXA 2010»
13 years 2 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
ERSHOV
2009
Springer
13 years 8 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
SEBD
1997
158views Database» more  SEBD 1997»
13 years 6 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
VLDB
2008
ACM
128views Database» more  VLDB 2008»
13 years 4 months ago
Reference-based indexing for metric spaces with costly distance measures
Jayendra Venkateswaran, Tamer Kahveci, Christopher...