300 search results - page 45 / 60 » Constrained Nearest Neighbor Queries |
PVLDB
2010
13 years 2 months ago
2010
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...