Skip to main content
SpringerLink
Log in

Finding optimal region for bichromatic reverse nearest neighbor in two- and three-dimensional spaces

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

The MaxBRNN problem is to find an optimal region such that setting up a new service within this region might attract the maximum number of customers by proximity. The MaxBRNN problem has many practical applications such as service location planning and emergency schedule. In typical real-life applications the data volume of the problem is huge, thus an efficient solution is highly desired. In this paper, we propose two efficient algorithms, namely, OptRegion, and 3D-OptRegion to tackle the MaxBRNN problem and MaxBRkNN in two- and three-dimensional spaces, especially for the 3D-OptRegion, we propose a powerful pruning strategy Fine-grained Pruning Strategy to reduce the searching space. Our method employs three optimization techniques, i.e., sweep line (sweep plane in a three-dimensional space), pruning strategy (based on upper bound estimation), and influence value computation (of candidate points), to improve the search performance. In a three-dimensional space, we additionally use a fine-grained pruning strategy to further improve the pruning effect. Extensive experimental evaluation using both real and synthetic datasets confirms that both OptRegion and 3D-OptRegion outperform the existing algorithms significantly under all problem instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Similar content being viewed by others

References

  1. Arya S, Mount D-M, Netanyahu N-S, Silverman R, Wu A-Y (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. JACM 45(6):891–923

    Article  Google Scholar 

  2. Berg M, Cheong O, Kreveld M, Overmars M (2009) Computational geometry: algorithms and applications. [M]. 3rd edn. Springer, p 32–55

  3. Bernecker T, Emrich T, Kriegel H-P, Renz M, Zankl S, Züfle A (2011) Efficient probabilistic reverse nearest neighbor query processing on uncertain data. VLDB:669–680

  4. Cabello S, Díaz-Báñez JM, Langerman S, Seara C, Ventura I (2005) Reverse facility location problems. CCCG

  5. Cabello S, Díaz-Báñez JM, Langerman S, Seara C, Ventura I (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99–106

    Article  Google Scholar 

  6. Cheema M-A, Zhang W, Lin X, Zhang Y, Li X (2012) Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. VLDB 21(1):69–95

    Article  Google Scholar 

  7. Chen Z, Wang L, Liu W (2012) Method for maximizing bichromatic reverse nearest neighbor in road networks. J Converg Inf Technol 7(4):125–133

    Article  Google Scholar 

  8. Chen F, Lin H, Gao Y, Lu D (2015) Capacity constrained maximizing bichromatic reverse nearest neighbor search. Expert Syst Appl. doi:10.1016/j.eswa.2015.08.051

    Google Scholar 

  9. Choi D-W, Chung C-W, Tao Y (2012) A scalable algorithm for maximizing range sum in spatial databases. VLDB 5:1088–1099

    Google Scholar 

  10. Du Y, Zhang D, Xia T (2005) The optimal-location query. SSTD:163–180

  11. Friedman J-H, Bentley J-L, Finkel R-A (1977) An algorithm for finding best matches in logarithmic expected time. ACM TOMS 3:209–226

    Article  Google Scholar 

  12. Gao Y, Zheng B, Chen G, Li Q, Guo X (2011) Continuous visible nearest neighbor query processing in spatial databases. VLDB 20(3):371–396

    Article  Google Scholar 

  13. Ghaemi P, Shahabi K, Wilson J-P, Banaei-Kashani F (2014) A comparative study of two approaches for supporting optimal network location queries. GeoInformatica 18(2):229–251

    Article  Google Scholar 

  14. Kang J-M, Mokbel MF, Shekhar S, Xia T, Zhang D (2007) Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. ICDE:781–790

  15. Korn F, Ukrishnan S-M (2000) Influence sets based on reverse nearest neighbor queries. SIGMOD:201–212

  16. Lin H, Chen F, Gao Y, Lu D (2013) OptRegion: finding optimal region for bichromatic reverse nearest neighbors. DASFAA

  17. Liu Y, Wong R-C, Wang K, Li Z-J, Chen C (2012) A new approach for maximizing bichromatic reverse nearest neighbor search. KAIS

  18. Nghiem T-P, Maulana K, Nguyen K, Green D et al (2014) Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks. J Parallel Distrib Comput 74(11):3128–3140

    Article  Google Scholar 

  19. Sedgewick R, Brown MH (1983) Data structures and algorithems. [M]. 1st edn. Addison-Wesley, Balanced Trees

  20. Shang S, Yuan B, Deng K, Xie K, Zhou X (2011) Find the most accessible locations: reverse path nearest neighbor query in road networks. ACM GIS:181–190

  21. Singh A, Ferhatosmanoglu H, Tosun A (2003) High dimensional reverse nearest neighbor queries. CIKM:91-98

  22. Stanoi I, Agrawald D (2000) Reverse nearest neighbor queries for dynamic databases. ACM SIGMOD DMKD:44–53

  23. Tao Y, Papadias D, Lian X (2004) Reverse KNN search in arbitrary dimensionality. VLDB:744-755

  24. TaoY, Hu X, Choi D-W, Chung C-W (2013) Approximate MaxRS in spatial databases. PVLDB:1546–1557

  25. Tran Q, Taniar D, Safar M (2010) Bichromatic reverse nearest-neighbor search in mobile systems. IEEE Syst J 4(2):230–242

    Article  Google Scholar 

  26. Wong R-C, Özsu MT, Yu P-S, Fu A-W, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. VLDB:1126–1137

  27. Wong R-C, Özsu MT, Fu A-W, Yu P-S, Liu L, Liu Y (2011) Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional space. VLDB 20:893–919

    Article  Google Scholar 

  28. Yan D, Zhao Z, Ng W (2012) Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces. CIKM:942–951

  29. Zhou Z, Wu W, Li X, Lee M-L, Hsu W (2011) MaxFirst for MaxBRkNN. ICDE:828–839

Download references

Acknowledgments

This research was partly supported by The National Science and Technology Supporting Plan-Project no. 2012BAH70F02, 2013BAH62F01 and 2013BAH62F02.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University, Hangzhou, People’s Republic of China

    Huaizhong Lin, Fangshu Chen, Yunjun Gao & Dongming Lu

Authors
  1. Huaizhong Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fangshu Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunjun Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dongming Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fangshu Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, H., Chen, F., Gao, Y. et al. Finding optimal region for bichromatic reverse nearest neighbor in two- and three-dimensional spaces. Geoinformatica 20, 351–384 (2016). https://doi.org/10.1007/s10707-015-0239-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-015-0239-5

Keywords

Search

Navigation