Download now Free registration required
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper the authors propose new solutions for evaluating RkNN queries and its variant bichromatic RkNN queries on 2-dimensional location data. They present an algorithm named INCH that can compute RkNN query's search region (from which the query result candidates are drawn). In their RkNN evaluation algorithm called FINCH, the search region restricts the search space, and the search region is tightened each time a new result candidate is found.
- Format: PDF
- Size: 517.61 KB