Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces

Authors:
Raymond Chi-Wing Wong;M. Tamer Özsu;Ada Wai-Chee Fu;Philip S. Yu;Lian Liu;Yubao Liu
Affiliations:
The Hong Kong University of Science and Technology, Hong Kong, People's Republic of China;University of Waterloo, Waterloo, Canada;The Chinese University of Hong Kong, Hong Kong, People's Republic of China;University of Illinois at Chicago, Chicago, USA;The Hong Kong University of Science and Technology, Hong Kong, People's Republic of China;Sun Yat-Sen University, Guangzhou, People's Republic of China
Venue:
The VLDB Journal — The International Journal on Very Large Data Bases
Year:
2011

Citing 16
Cited 2

New upper bounds for neighbor searching

Information and Control
Filtering search: a new approach to query answering

SIAM Journal on Computing
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Influence sets based on reverse nearest neighbor queries

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Discovery of Influence Sets in Frequently Updated Databases

Proceedings of the 27th International Conference on Very Large Data Bases
Content-Based Image Indexing

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

Geoinformatica
On computing top-t most influential spatial sites

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Progressive computation of the min-dist optimal-location query

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Spatial Query Estimation without the Local Uniformity Assumption

Geoinformatica
On efficient spatial matching

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Capacity constrained assignment in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient method for maximizing bichromatic reverse nearest neighbor

Proceedings of the VLDB Endowment
The optimal-location query

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

Finding top k most influential spatial facilities over uncertain objects

Proceedings of the 21st ACM international conference on Information and knowledge management
Location selection for utility maximization with capacity constraints

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

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 for L p -norm in two- and three- dimensional spaces. 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, there are no existing algorithms which solve MaxBRNN for any L p -norm space of two- and three-dimensionality. Based on some interesting properties of the problem, we come up with an efficient algorithm called MaxOverlap for to solve this problem. Extensive experiments are conducted to show that our algorithm is efficient.