Skip to main content
SpringerLink
Log in

Reverse Approximate Nearest Neighbor Queries on Road Network

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Reverse k Nearest Neighbor (RkNN) queries retrieve all objects that consider the query as one of their k most influential objects. Given a set of user U, a set of facilities F and a value k, a facility f is said to be influential to a user u if f is one of the k closest facilities to u. As a complement of RkNN query, Reverse Approximate Nearest Neighbor (RANN) query considers relaxed definition of influence, where a user u is influenced by not only its closest facility, but also by every other facility that is almost as close to u as its closest facility is. In this paper, we study RANN query on road network. Existing RANN techniques and algorithms only work for queries on Euclidean space and are not directly applicable for RANN queries on road network. We propose pruning techniques that utilize Network Voronoi Diagram (NVD) to efficiently solve RANN query on road network. We conduct extensive experimental study on different real data sets and demonstrate that our algorithm is significantly better than the competitor.

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.

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

Similar content being viewed by others

References

  1. Akiba, T., Iwata, Y., Kawarabayashi, K.i., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: 2014 Proceedings of the sixteenth workshop on algorithm engineering and experiments (ALENEX), pp. 147–154, SIAM (2014)

  2. Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Database engineering and applications symposium, 2002. Proceedings. International, pp. 44–53, IEEE (2002)

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

    Article  Google Scholar 

  4. Cheema, M.A., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans. Knowl. Data Eng. 22(4), 550–564 (2010)

    Article  Google Scholar 

  5. Cheema, M.A., Lin, X., Zhang, W., Zhang, Y.: Influence zone: Efficiently processing reverse k nearest neighbors queries. In: Data engineering (ICDE), 2011 IEEE 27th international conference on, pp. 577–588, IEEE (2011)

  6. Cheema, M.A., Zhang, W., Lin, X., Zhang, Y., Li, X.: Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. The VLDB Journal—The International Journal on Very Large Data Bases 21(1), 69–95 (2012)

    Article  Google Scholar 

  7. Demiryurek, U., Shahabi, C.: Indexing network voronoi diagrams. In: International conference on database systems for advanced applications, pp. 526–543, Springer (2012)

  8. DIMACS: 9th dimacs implementation challenge - shortest paths. http://users.diag.uniroma1.it/challenge9/ (2006)

  9. Erwig, M.: The graph voronoi diagram with applications. Networks: An International Journal 36(3), 156–163 (2000)

    Article  MathSciNet  Google Scholar 

  10. Gotoh, Y., Okubo, C.: A searching method for bichromatic reverse k-nearest neighbor with network voronoi diagram. In: Proceedings of the 14th international conference on advances in mobile computing and multi media, MoMM ’16, pp. 71–78. Association for Computing Machinery, New York, NY, USA (2016), https://doi.org/10.1145/3007120.3007133

  11. Hidayat, A., Cheema, M.A., Taniar, D.: Relaxed reverse nearest neighbors queries. In: Advances in spatial and temporal databases - 14th International symposium, SSTD 2015, Hong Kong, China, August 26-28, 2015. Proceedings, pp. 61–79 (2015), https://doi.org/10.1007/978-3-319-22363-6_4

  12. Hidayat, A., Yang, S., Cheema, M.A., Taniar, D.: Reverse approximate nearest neighbor queries. IEEE Trans. Knowl. Data Eng. 30(2), 339–352 (2018)

    Article  Google Scholar 

  13. Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.: Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: ICDE, pp. 806–815 (2007)

  14. Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the thirtieth international conference on very large data bases-Volume 30, pp. 840–851, VLDB Endowment (2004)

  15. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: ACM Sigmod record, 29, pp. 201–212, ACM (2000)

  16. Li, C., Gu, Y., Qi, J., Zhang, R., Yu, G.: Moving knn query processing in metric space based on influential sets. Inf. Syst. 83, 126–144 (2019). https://doi.org/10.1016/j.is.2019.03.008. http://www.sciencedirect.com/science/article/pii/S0306437918304204

    Article  Google Scholar 

  17. Li, G., Li, Y., Li, J., Shu, L., Yang, F.: Continuous reverse k nearest neighbor monitoring on moving objects in road networks. Inf. Syst. 35(8), 860–883 (2010)

    Article  Google Scholar 

  18. Li, Y., Yiu, M.L., Kou, N.M., et al.: An experimental study on hub labeling based shortest path algorithms. Proceedings of the VLDB Endowment 11(4), 445–457 (2017)

    Article  Google Scholar 

  19. Lian, X., Chen, L.: Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J. 18(3), 787–808 (2009)

    Article  Google Scholar 

  20. Nutanong, S., Tanin, E., Ali, M.E., Kulik, L.: Local network voronoi diagrams. In: Proceedings of the 18th SIGSPATIAL international conference on advances in geographic information systems, pp. 109–118, ACM (2010)

  21. Safar, M., Ibrahimi, D., Taniar, D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia systems 15(5), 295–308 (2009)

    Article  Google Scholar 

  22. Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases.. In: ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp. 44–53 (2000)

  23. Sun, H.-L., Jiang, C., Liu, J.-L., Sun, L.: Continuous reverse nearest neighbor queries on moving objects in road networks. In: The ninth international conference on web-age information management, pp. 238–245, IEEE (2008)

  24. Taniar, D., Rahayu, W.: A taxonomy for nearest neighbour queries in spatial databases. J. Comput. Syst. Sci. 79(7), 1017–1039 (2013)

    Article  MathSciNet  Google Scholar 

  25. Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: Proceedings of the thirtieth international conference on very large data bases-Volume 30, pp. 744–755, VLDB Endowment (2004)

  26. Wang, S., Cheema, M.A., Lin, X.: Efficiently monitoring reverse k-nearest neighbors in spatial networks. Comput. J. 58(1), 40–56 (2015)

    Article  Google Scholar 

  27. Wu, W., Yang, F., Chan, C.-Y., Tan, K.-L.: Finch: Evaluating reverse k-nearest-neighbor queries on location data. Proceedings of the VLDB endowment 1(1), 1056–1067 (2008)

    Article  Google Scholar 

  28. Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: Data engineering, 2006. ICDE’06. Proceedings of the 22nd international conference on, pp. 77–77, IEEE (2006)

  29. Xuan, K., Zhao, G., Taniar, D., Srinivasan, B., Safar, M., Gavrilova, M.: Network voronoi diagram based range search. In: 2009 International conference on advanced information networking and applications, pp. 741–748 (2009)

  30. Yang, C., Lin, K-I.: An index structure for efficient reverse nearest neighbor queries. In: Data engineering, 2001. Proceedings. 17th International conference on, pp. 485–492, IEEE (2001)

  31. Yang, S., Cheema, M.A., Lin, X., Zhang, Y.: Slice: reviving regions-based pruning for reverse k nearest neighbors queries. In: Data engineering (ICDE), 2014 IEEE 30th International conference on, pp. 760–771, IEEE (2014)

  32. Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. IEEE Trans. Knowl. Data Eng., pp. 540–553 (2006)

Download references

Acknowledgements

Muhammad Aamir Cheema is supported by Australian Research Council FT180100140 and DP180103411.

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Monash University, Melbourne, Australia

    Xinyu Li, David Taniar & Muhammad Aamir Cheema

  2. Brawijaya University, Malang, Indonesia

    Arif Hidayat

Authors
  1. Xinyu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arif Hidayat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Taniar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Muhammad Aamir Cheema
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arif Hidayat.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Hidayat, A., Taniar, D. et al. Reverse Approximate Nearest Neighbor Queries on Road Network. World Wide Web 24, 279–296 (2021). https://doi.org/10.1007/s11280-020-00848-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-020-00848-1

Keywords

Search

Navigation