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

11 Figures and Tables

Statistics

0102020102011201220132014201520162017
Citations per Year

86 Citations

Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Wong2009EfficientMF, title={Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor}, author={Raymond Chi-Wing Wong and M. Tamer {\"{O}zsu and Philip S. Yu and Ada Wai-Chee Fu and Lian Liu}, journal={PVLDB}, year={2009}, volume={2}, pages={1126-1137} }