3 search results - page 1 / 1 » K nearest neighbor queries and kNN-Joins in large relational... |
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
SIGMOD
2002
ACM
14 years 4 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...