Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor

Abstract

Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper , we study a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs. Such a problem has many real life applications, including the problem of finding a new server point that attracts as many customers as possible by proximity. A straightforward approach is to determine the BRNNs for all possible points that are not feasible since there are a large (or infinite) number of possible points. To the best of our knowledge, the fastest known method has exponential time complexity on the data size. Based on some interesting properties of the problem, we come up with an efficient algorithm called MaxOverlap. Extensive experiments are conducted to show that our algorithm is many times faster than the best-known technique.

Extracted Key Phrases

16 Figures and Tables

Showing 1-10 of 18 references

Efficient method for maximizing bichromatic reverse nearest neighbor

  • W Wong, T Ozsu, P S Yu, A W.-C Fu
  • 2009
1 Excerpt
Showing 1-10 of 52 extracted citations

Statistics

010203020102011201220132014201520162017
Citations per Year

83 Citations

Semantic Scholar estimates that this publication has received between 55 and 131 citations based on the available data.

See our FAQ for additional information.