360 search results - page 2 / 72 » Indexing the Distance: An Efficient Method to KNN Processing |
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
VLDB
2004
ACM
14 years 5 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...