Journal Article10.14778/1687627.1687754
Efficient method for maximizing bichromatic reverse nearest neighbor
Raymond Chi-Wing Wong,M. Tamer Özsu,Philip S. Yu,Ada Wai-Chee Fu,Lian Liu +4 more
- 01 Aug 2009
- Vol. 2, Iss: 1, pp 1126-1137
TL;DR: This paper studies a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs and comes up with an efficient algorithm called MaxOverlap, which is many times faster than the best-known technique.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient method for maximizing bichromatic reverse nearest neighbor
Raymond Chi-Wing Wong,M. Tamer Özsu,Philip S. Yu,Ada Wai-Chee Fu,Lian Liu +4 more
- 01 Aug 2009
TL;DR: This paper studies a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs and comes up with an efficient algorithm called MaxOverlap, which is many times faster than the best-known technique.
Optimal location queries in road network databases
Xiaokui Xiao,Bin Yao,Feifei Li +2 more
- 11 Apr 2011
TL;DR: A unified framework is proposed that addresses three variants of OL queries that find important applications in practice, and is instantiate the framework with several novel query processing algorithms.
MaxFirst for MaxBRkNN
Zenan Zhou,Wei Wu,Xiaohui Li,Mong Li Lee,Wynne Hsu +4 more
- 11 Apr 2011
TL;DR: An efficient solution called MaxFirst is presented to solve the generalized MaxBRkNN problem which finds an optimal region such that setting up a service site in this region guarantees the maximum number of customers who would consider the site as one of their k nearest service locations.
77
Trajectory-driven Influential Billboard Placement
Ping Zhang,Zhifeng Bao,Yuchen Li,Guoliang Li,Yipeng Zhang,Zhiyong Peng +5 more
- 19 Jul 2018
TL;DR: In this article, the problem of trajectory-driven influential billboard placement is studied and a partition-based framework is proposed to identify and reduce the overlap of the influence from different billboards to the same trajectories while keeping the budget constraint into consideration.
64
Top-k most influential locations selection
Jin Huang,Zeyi Wen,Jianzhong Qi,Rui Zhang,Jian Chen,Zhen He +5 more
- 24 Oct 2011
TL;DR: Two branch and bound algorithms are proposed, the Estimation Expanding Pruning (EEP) algorithm and the Bounding Influence Pruned (BIP) algorithm, which exploit various geometric properties to prune the search space and achieve much better performance than that of the naive algorithm.
References
•Book
Computational Geometry: Algorithms and Applications
Mark de Berg,Otfried Cheong,Marc van Kreveld,Mark H. Overmars +3 more
- 01 Jan 1997
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
5.8K
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann,Hans-Peter Kriegel,Ralf Schneider,Bernhard Seeger +3 more
- 01 May 1990
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
The simple plant location problem: Survey and synthesis
Jakob Krarup,Peter Pruzan +1 more
TL;DR: In this paper, the authors consider a family of discrete, deterministic, single-criterion, NP-hard problems, including set packing, set covering, and set partitioning.
591
State of the Art-Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
TL;DR: In this paper, the authors present a survey of the literature on tree-based network location problems, focusing on single objective function problems, where the objective is to minimize either a sum of transport costs proportional to network travel distances between existing facilities and closest new facilities, or a maximum of "losses" proportional to such travel distances, or the total number of new facilities to be located.
Filtering search: a new approach to query answering
TL;DR: This work introduces a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very effectively.
Related Papers (5)
Yang Du,Donghui Zhang,Tian Xia +2 more
- 22 Aug 2005
Zenan Zhou,Wei Wu,Xiaohui Li,Mong Li Lee,Wynne Hsu +4 more
- 11 Apr 2011
Donghui Zhang,Yang Du,Tian Xia,Yufei Tao +3 more
- 01 Sep 2006
Tian Xia,Donghui Zhang,Evangelos Kanoulas,Yang Du +3 more
- 30 Aug 2005
Xiaokui Xiao,Bin Yao,Feifei Li +2 more
- 11 Apr 2011