Sciweavers

20 search results - page 4 / 4
» Multidimensional reverse k NN search
Sort
View
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 6 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
ADC
2003
Springer
127views Database» more  ADC 2003»
13 years 9 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
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
13 years 10 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
SAC
2008
ACM
13 years 4 months ago
Trajectory retrieval with latent semantic analysis
The problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. In this work, we study trajectory similar...
Apostolos N. Papadopoulos
EDBT
2009
ACM
184views Database» more  EDBT 2009»
13 years 11 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer