Graph-decomposed k-NN searching algorithm on road network

Graphical abstract

References

[1] Li Y, Yuan Y, Wang Y, Lian X, Ma Y, Wang G . Distributed multimodal path queries. IEEE Transactions on Knowledge and Data Engineering, 2022, 34( 7): 3196–3210

[2] Haldar N A H, Li J, Ali M E, Cai T, Chen Y, Sellis T, Reynolds M . Top-k socio-spatial co-engaged location selection for social users. IEEE Transactions on Knowledge and Data Engineering, 2023, 35( 5): 5325–5340

[3] Dijkstra E W. . A note on two problems in connexion with graphs. Numerische Mathematik, 1959, 1: 269–271

[4] Ouyang D, Wen D, Qin L, Chang L, Zhang Y, Lin X. Progressive top-K nearest neighbors search in large road networks. In: Proceedings of 2020 ACM SIGMOD International Conference on Management of Data. 2020, 1781−1795

[5] Zeng Y, Tong Y, Chen L . LiteHST: a tree embedding based method for similarity search. Proceedings of the ACM on Management of Data, 2023, 1( 1): 35

[6] Li Z, Chen L, Wang Y. G-tree: an efficient spatial index on road networks. In: Proceedings of the 35th International Conference on Data Engineering. 2019, 268−279

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61976032 and 62002039) and the GenReral Scientific Research Project of Liaoning (No. LJKZ0063).

Competing interests

The authors declare that they have no competing interests or financial conflicts to disclose.

Supporting information

The supporting information is available online at journal.hep.com.cn and link.springer.com.

RIGHTS & PERMISSIONS

2024 Higher Education Press