Nearest neighbor queries in metric spaces

Publisher Website
Google Scholar
Abstract
Given a set S of n sites (points), and a distance measure d, the nearest neighbor searching problem is to build a data structure so that given a query point q, the site nearest to q can be found quickly. This paper gives data structures for this problem when the sites and queries are in a met- ric space. One data structure, D(S), uses a divide-and-conquer recursion. The other data structure, M(S,Q), is somewhat like a skiplist. Both are simple and implementable. The data structures are analyzed when the metric space obeys a certain sphere-packing bound, and when the sites and query points are random and have distributions with an exchange- ability property. This property implies, for example, that query point q is a random element of S ( {q}. Under these conditions, the preprocess- ing and space bounds for the algorithms are close to linear in n. They depend also on the sphere-packing bound, and on the logarithm of the distance ratio ( S) of S, the ratio of the distance between the farthest pair of points in S to the distance between the closest pair. The data structure M(S,Q) requires as input data an additional set Q, taken to be representative of the query points. The resource bounds of M(S,Q) have a dependence on the distance ratio of S ( Q. While M(S,Q) can return wrong answers, its failure probability can be bounded, and is decreasing in a parameter K. Here K | Q|/n is chosen when building M(S,Q). The expected query time for M(S,Q) is O(K logn)log( S (Q), and the resource bounds increase linearly in K. The data structure D(S) has ex- pected O(logn)O(1) query time, for fixed distance ratio. The preprocess- ing algorithm for M(S,Q) can be used to solve the all-nearest-neighbor problem for S in O(n(logn)2(log( S))2) expected time.

This publication has 0 references indexed in Scilit: