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
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
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
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Optimal network location queries
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
Finding the sites with best accessibilities to amenities
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
Efficient methods for finding influential locations with adaptive grids
Proceedings of the 20th ACM international conference on Information and knowledge management
Top-k most influential locations selection
Proceedings of the 20th ACM international conference on Information and knowledge management
Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces
The VLDB Journal — The International Journal on Very Large Data Bases
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Location selection for utility maximization with capacity constraints
Proceedings of the 21st ACM international conference on Information and knowledge management
Continuous maximal reverse nearest neighbor query on spatial networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
On optimal worst-case matching
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Optimal k-constraint coverage queries on spatial objects
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
A branch and bound method for min-dist location selection queries
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
UV-diagram: a voronoi diagram for uncertain spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate MaxRS in spatial databases
Proceedings of the VLDB Endowment
Solving the k-influence region problem with the GPU
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.