Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Continuous monitoring of reverse approximate nearest neighbour queries on road network

Published: 01 May 2024 Publication History

Abstract

Reverse Approximate Nearest Neighbour (RANN) query relaxes the RkNN definition of influence, where a user u can be 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 the continuous monitoring of RANN queries on road network. Existing continuous RANN algorithms on Euclidean space cannot be extended to continuously monitor RANN queries on road network. We propose two different methods to efficiently monitor RANN queries. We conduct an extensive experiment on different real data sets and demonstrate that our both proposed algorithms are significantly better than the competitor

References

[1]
D. Taniar, W. Rahayu, A taxonomy for nearest neighbour queries in spatial databases, J. Comput. Syst. Sci. 79 (7) (2013) 1017–1039.
[2]
A. Hidayat, M.A. Cheema, D. Taniar, Relaxed reverse nearest neighbors queries, in: Advances in Spatial and Temporal Databases - 14th International Symposium, SSTD 2015, Proceedings, Hong Kong, China, August 26–28, 2015, 2015, pp. 61–79,.
[3]
A. Hidayat, S. Yang, M.A. Cheema, D. Taniar, Reverse approximate nearest neighbor queries, IEEE Trans. Knowl. Data Eng. 30 (2) (2018) 339–352.
[4]
X. Li, A. Hidayat, D. Taniar, M.A. Cheema, Reverse Approximate Nearest Neighbor Queries on Road Network, World Wide Web, 2020, pp. 1–18.
[5]
T. Imielinski, B. Badrinath, Querying in highly mobile distributed environments, in: VLDB, vol. 92, 1992, pp. 41–52.
[6]
R. Benetis, C.S. Jensen, G. Karciauskas, S. Saltenis, Nearest neighbor and reverse nearest neighbor queries for moving objects, in: Database Engineering and Applications Symposium, 2002, Proceedings, International, IEEE, 2002, pp. 44–53.
[7]
T. Xia, D. Zhang, Continuous reverse nearest neighbor monitoring, in: Proceedings of the 22nd International Conference on Data Engineering, 2006, ICDE'06, IEEE, 2006, p. 77.
[8]
J.M. Kang, M.F. Mokbel, S. Shekhar, T. Xia, D. Zhang, Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors, in: ICDE, 2007, pp. 806–815.
[9]
M.A. Cheema, W. Zhang, X. Lin, Y. Zhang, X. Li, Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks, VLDB J. 21 (1) (2012) 69–95.
[10]
M. Erwig, The graph Voronoi diagram with applications, Networks 36 (3) (2000) 156–163.
[11]
M. Kolahdouzan, C. Shahabi, Voronoi-based k nearest neighbor search for spatial network databases, in: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, VLDB Endowment, 2004, pp. 840–851.
[12]
C. Li, Y. Gu, J. Qi, R. Zhang, G. Yu, Moving knn query processing in metric space based on influential sets, Inf. Sci. 83 (2019) 126–144.
[13]
S. Nutanong, E. Tanin, M.E. Ali, L. Kulik, Local network Voronoi diagrams, in: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM, 2010, pp. 109–118.
[14]
Y. Gotoh, C. Okubo, 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, 2016, pp. 71–78.
[15]
M. Safar, D. Ibrahimi, D. Taniar, Voronoi-based reverse nearest neighbor query processing on spatial networks, Multimed. Syst. 15 (5) (2009) 295–308.
[16]
K. Xuan, G. Zhao, D. Taniar, B. Srinivasan, M. Safar, M. Gavrilova, Network Voronoi diagram based range search, in: 2009 International Conference on Advanced Information Networking and Applications, IEEE, 2009, pp. 741–748.
[17]
S. Šaltenis, C.S. Jensen, S.T. Leutenegger, M.A. Lopez, Indexing the positions of continuously moving objects, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 331–342.
[18]
M.A. Cheema, X. Lin, Y. Zhang, W. Wang, W. Zhang, Lazy updates: an efficient technique to continuously monitoring reverse knn, Proc. VLDB Endow. 2 (1) (2009) 1138–1149.
[19]
J. Qi, R. Zhang, C.S. Jensen, K. Ramamohanarao, J. He, Continuous spatial query processing: a survey of safe region based techniques, ACM Comput. Surv. 51 (3) (2018) 1–39.
[20]
M.A. Cheema, X. Lin, W. Zhang, Y. Zhang, Influence zone: efficiently processing reverse k nearest neighbors queries, in: 2011 IEEE 27th International Conference on Data Engineering (ICDE), IEEE, 2011, pp. 577–588.
[21]
M.A. Cheema, W. Zhang, X. Lin, Y. Zhang, Efficiently processing snapshot and continuous reverse k nearest neighbors queries, VLDB J. 21 (5) (2012) 703–728.
[22]
T. Akiba, Y. Iwata, K.-i. Kawarabayashi, Y. Kawata, 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), SIAM, 2014, pp. 147–154.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Information Sciences: an International Journal
Information Sciences: an International Journal  Volume 667, Issue C
May 2024
974 pages

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 01 May 2024

Author Tags

  1. RkNN
  2. RANN
  3. NVD

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media