Skip to main content
SpringerLink
Log in

Reverse Furthest Neighbors Query in Road Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Given a road network G = (V,E), where V (E) denotes the set of vertices(edges) in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors (Rfn R ) query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in P ∪ {q}. This is the monochromatic Rfn R (Mrfn R ) query. Another interesting version of Rfn R query is the bichromatic reverse furthest neighbor (Brfn R ) query. Given two sets of points P and Q, and a query point q ∈ Q, a Brfn R query fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in Q. This paper presents efficient algorithms for both Mrfn R and Brfn R queries, which utilize landmarks and partitioning-based techniques. Experiments on real datasets confirm the efficiency and scalability of proposed algorithms.

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.

Similar content being viewed by others

References

  1. Lin X H, Kwok Y K, Wang H, Xie N. A game theoretic approach to balancing energy consumption in heterogeneous wireless sensor networks. Wireless Communications and Mobile Computing, 2015, 15(1): 170-191.

    Article  Google Scholar 

  2. Hao J Y, Leung H F, Ming Z. Multiagent reinforcement social learning toward coordination in cooperative multiagent systems. ACM Transactions on Autonomous and Adaptive Systems, 2015, 9(4): Article No.20.

  3. Tan L J, Lin F Y, Wang H. Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with time windows. Neurocomputing, 2015, 151: 1208-1215.

    Article  Google Scholar 

  4. Xu L, Hu Q H, Hung E, Chen B W, Tan X, Liao C R. Large margin clustering on uncertain data by considering probability distribution similarity. Neurocomputing, 2015, 158: 81-89.

    Article  Google Scholar 

  5. Chen H, Ni D, Qin J, Li S L, Yang X, Wang T F, Heng P A. Standard plane localization in fetal ultrasound via domain transferred deep neural networks. IEEE Journal of Biomedical and Health Informatics, 2015, 19(5): 1627-1636.

    Article  Google Scholar 

  6. Luo J P, Li X, Chen M R, Liu H W. A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows. Information Sciences, 2015, 316: 266-292.

    Article  Google Scholar 

  7. Li H C, Wu K S, Zhang Q, Ni L M. CUTS: Improving channel utilization in both time and spatial domain in WLANs. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(6): 1413-1423.

    Article  Google Scholar 

  8. Cao W M, Liu N, Kong Q C, Feng H. Content-based image retrieval using high-dimensional information geometry. Science China Information Sciences, 2014, 57(7): 1-11.

    MATH  MathSciNet  Google Scholar 

  9. Lai Z H, Xu Y, Chen Q C, Yang J, Zhang D. Multilinear sparse principal component analysis. IEEE Transactions on Neural Networks and Learning Systems, 2014, 25(10): 1942-1950.

    Article  Google Scholar 

  10. Chen W S, Wang W, Yang J W, Tang Y Y. Supervised regularization locality-preserving projection method for face recognition. International Journal of Wavelets, Multiresolution and Information Processing, 2012, 10(6): 1250053.

  11. Fekete S P, Kröller A. Geometry-based reasoning for a large sensor network. In Proc. the 22nd ACM Symposium on Computational Geometry, June 2006, pp.475-476.

  12. Tao Y F, Papadias D, Lian X, Xiao X K. Multidimensional reverse kNN search. The VLDB Journal, 2007, 16(3): 293-316.

    Article  Google Scholar 

  13. Kang J M, Mokbel M F, Shekhar S, Xia T, Zhang D H. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In Proc. the 23rd International Conference on Data Engineering, April 2007, pp.806-815.

  14. Yiu M L, Mamoulis N. Reverse nearest neighbors search in ad hoc subspaces. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(3): 412-426.

    Article  Google Scholar 

  15. Korn F, Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. In Proc. the ACM SIGMOD International Conference on Management of Data, May 2000, pp.201-212.

  16. Tao Y F, Papadias D, Lian X. Reverse kNN search in arbitrary dimensionality. In Proc. the 30th International Conference on Very Large Data Bases, August 2004, pp.744-755.

  17. Singh A, Ferhatosmanoglu H, Tosun A. High dimensional reverse nearest neighbor queries. In Proc. the 12th International Conference on Information and Knowledge Management, November 2003, pp.91-98.

  18. Korn F, Muthukrishnan S, Srivastava D. Reverse nearest neighbor aggregates over data streams. In Proc. the 28th International Conference on Very Large Data Bases, August 2002, pp.814-825.

  19. Yang C Y, Lin K I. An index structure for efficient reverse nearest neighbor queries. In Proc. the 17th International Conference on Data Engineering, April 2001, pp.485-492.

  20. Stanoi I, Riedewald M, Agrawal D, Abbadi A E. Discovery of influence sets in frequently updated databases. In Proc. the 27th International Conference on Very Large Data Bases, September 2001, pp.99-108.

  21. Cheema M A, Lin X M, Zhang W J, Zhang Y. Influence zone: Efficiently processing reverse k nearest neighbors queries. In Proc. the 27th International Conference on Data Engineering, April 2011, pp.577-588.

  22. Achtert E, Böhm C, Kröger P, Kunath P, Pryakhin A, Renz M. Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In Proc. ACM SIGMOD International Conference on Management of Data, June 2006, pp.515-526.

  23. Yiu M L, Papadias D, Mamoulis N, Tao Y F. Reverse nearest neighbors in large graphs. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(4): 540-553.

    Article  Google Scholar 

  24. Xia T, Zhang D H. Continuous reverse nearest neighbor monitoring. In Proc. the 22nd International Conference on Data Engineering, April 2006, p.77.

  25. Benetis R, Jensen C S, Karciauskas G, Saltenis S. Nearest and reverse nearest neighbor queries for moving objects. The VLDB Journal, 2006, 15(3): 229-249.

    Article  Google Scholar 

  26. Yao B, Li F F, Kumar P. Reverse furthest neighbors in spatial databases. In Proc. the 25th International Conference on Data Engineering, March 2009, pp.664-675.

  27. Tran Q T, Taniar D, Safar M. Reverse k nearest neighbor and reverse farthest neighbor search on spatial networks. In Transactions on Large-Scale Data-and Knowledge-Centered Systems I, Hameurlain A, Küng J, Wagner R (eds.), Springer-Verlag, 2009, pp.353-372.

  28. Goldberg A V, Harrelson C. Computing the shortest path: A search meets graph theory. In Proc. the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2005, pp.156-165.

  29. Hendrickson B, Leland R. A multilevel algorithm for partitioning graphs. In Proc. the IEEE/ACM SC95 Conference on Supercomputing, December 1995, p.28.

  30. Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAMJournal on Scientific Computing, 1998, 20(1): 359-392.

    Article  MATH  MathSciNet  Google Scholar 

  31. Kernighan BW, Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970, 49(2): 291-307.

    Article  MATH  Google Scholar 

  32. Pellegrini F, Roman J. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In Proc. International Conference on High-Performance Computing and Networking, April 1996, pp.493-498.

  33. Jing N, Huang Y W, Rundensteiner E A. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineering, 1998, 10(3): 409-432.

    Article  Google Scholar 

  34. Erwig M. The graph Voronoi diagram with applications. Networks, 2000, 36(3): 156-163.

    Article  MATH  MathSciNet  Google Scholar 

  35. Aurenhammer F. Voronoi diagrams — A survey of a fundamental geometric data structure. ACM Computing Surveys, 1991, 23(3): 345-405.

    Article  Google Scholar 

  36. Shekhar S, Liu D R. CCAM: A connectivity-clustered access method for networks and network computations. IEEE Transactions on Knowledge and Data Engineering, 1997, 9(1): 102-119.

    Article  Google Scholar 

  37. Shang S, Chen L S, Wei Z W, Jensen C S, Wen J R, Kalnis P. Collective travel planning in spatial networks. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(5): 1132-1146.

    Article  Google Scholar 

  38. Shang S, Liu J J, Zheng K, Lu H, Pedersen T B, Wen J R. Planning unobstructed paths in traffic-aware spatial networks. GeoInformatica, 2015, 19(4): 723-746.

    Article  Google Scholar 

  39. Shang S, Ding R G, Zheng K, Jensen C S, Kalnis P, Zhou X F. Personalized trajectory matching in spatial networks. The VLDB Journal, 2014, 23(3): 449-468.

    Article  Google Scholar 

  40. Shang S, Ding R G, Yuan B, Xie K X, Zheng K, Kalnis P. User oriented trajectory search for trip recommendation. In Proc. the 15th International Conference on Extending Database Technology, March 2012, pp.156-167.

  41. Zhu Z X, Xiao J, Li J Q,Wang F X, Zhang Q F. Global path planning of wheeled robots using multi-objective memetic algorithms. Integrated Computer-Aided Engineering, 2015, 22(4): 387-404.

    Article  Google Scholar 

  42. Guo X N, Zhang D, Wu K S, Ni L M. MODLoc: Localizing multiple objects in dynamic indoor environment. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(11): 2969-2980.

    Article  Google Scholar 

  43. Li R H, Yu J X, Huang X, Cheng H, Shang Z C. Measuring the impact of MVC attack in large complex networks. Information Sciences, 2014, 278: 685-702.

    Article  MathSciNet  Google Scholar 

  44. Shi Y F, Long P X, Xu K, Huang H, Xiong Y S. Data-driven contextual modeling for 3D scene understanding. Computers & Graphics, 2016, 55: 55-67.

    Article  Google Scholar 

  45. Li B C, Li R H, King I, Lyu M R, Yu J X. A topic-biased user reputation model in rating systems. Knowledge and Information Systems, 2015, 44(3): 581-607.

    Article  Google Scholar 

  46. Li B, Tan S Q, Wang M, Huang J W. Investigation on cost assignment in spatial image steganography. IEEE Transactions on Information Forensics and Security, 2014, 9(8): 1264-1277.

    Article  Google Scholar 

  47. Li B, Wang M, Li X L, Tan S Q, Huang J W. A strategy of clustering modification directions in spatial image steganography. IEEE Transactions on Information Forensics and Security, 2015, 10(9): 1905-1917.

    Article  Google Scholar 

  48. Yang X, Pei J H, Sun W. Elastic image registration using hierarchical spatially based mean shift. Computers in Biology and Medicine, 2013, 43(9): 1086-1097.

    Article  Google Scholar 

  49. Zhou F, Jiao J X, Lei B Y. A linear threshold-hurdle model for product adoption prediction incorporating social network effects. Information Sciences, 2015, 307: 95-109.

    Article  Google Scholar 

  50. Wang J G, Huang J Z, Guo J F, Lan Y Y. Recommending high-utility search engine queries via a query-recommending model. Neurocomputing, 2015, 167: 195-208.

    Article  Google Scholar 

  51. Lin J C, Gan W S, Fournier-Viger P, Hong T P, Tseng V S. Efficient algorithms for mining high-utility itemsets in uncertain databases. Knowledge-Based Systems, 2016, 96: 171-187.

    Article  Google Scholar 

  52. Du S Y, Guo Y R, Sanroma G, Ni D, Wu G R, Shen D G. Building dynamic population graph for accurate correspondence detection. Medical Image Analysis, 2015, 26(1): 256-267.

    Article  Google Scholar 

  53. Luo X, Ming Z, You Z H, Li S, Xia Y N, Leung H. Improving network topology-based protein interactome mapping via collaborative filtering. Knowledge-Based Systems, 2015, 90: 23-32.

    Article  Google Scholar 

  54. Li R H, Yu J X. Triangle minimization in large networks. Knowledge and Information Systems, 2015, 45(3): 617-643.

    Article  Google Scholar 

  55. Dai M J, Sung C W. Achieving high diversity and multiplexing gains in the asynchronous parallel relay network. Transactions on Emerging Telecommunications Technologies, 2013, 24(2): 232-243.

    Article  Google Scholar 

  56. Zhang D, Lu K Z, Mao R. A precise RFID indoor localization system with sensor network assistance. China Communications, 2015, 12(4): 13-22.

    Article  Google Scholar 

  57. Huang X, Cheng H, Li R H, Qin L, Yu J X. Top-K structural diversity search in large networks. The VLDB Journal, 2015, 24(3): 319-343.

    Article  Google Scholar 

  58. Wu R B, Li C, Lu D. Power minimization with derivative constraints for high dynamic GPS interference suppression. Science China-Information Sciences, 2012, 55(4): 857-866.

    Article  MathSciNet  Google Scholar 

  59. Zhao Q L, Liew S C, Zhang S L, Yu Y. Distance-based location management utilizing initial position for mobile communication networks. IEEE Transactions on Mobile Computing, 2016, 15(1): 107-120.

    Article  Google Scholar 

  60. Wang J Y, Feng JW, Xu C, Zhao Y, Feng J Q. Pinning synchronization of nonlinearly coupled complex networks with time-varying delays using M-matrix strategies. Neurocomputing, 2016, 177: 89-97.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software, Beijing Institute of Technology, Beijing, 100081, China

    Xiao-Jun Xu

  2. First Research Institute of Ministry of Public Security, Beijing, 100048, China

    Xiao-Jun Xu

  3. College of Mechanical Engineering, Donghua University, Shanghai, 200051, China

    Jin-Song Bao

  4. Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai, 200240, China

    Bin Yao, Jing-Yu Zhou, Fei-Long Tang & Min-Yi Guo

  5. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Bin Yao, Jing-Yu Zhou, Fei-Long Tang & Min-Yi Guo

  6. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

    Jian-Qiu Xu

Authors
  1. Xiao-Jun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Song Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jing-Yu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fei-Long Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Min-Yi Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Jian-Qiu Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jin-Song Bao or Bin Yao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, XJ., Bao, JS., Yao, B. et al. Reverse Furthest Neighbors Query in Road Networks. J. Comput. Sci. Technol. 32, 155–167 (2017). https://doi.org/10.1007/s11390-017-1711-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-017-1711-5

Keywords

Search

Navigation