Graph-decomposed k-NN searching algorithm on road network
Wei JIANG1, Bo NING1(), Guanyu LI1, Mei BAI1, Xiao JIA2, Fangliang WEI1
1. Faculty of Information Science and Technology, Dalian Maritime University, Dalian 116026, China 2. Jiangxing Intelligence Inc., Shenzhen 518100, China
Y, Li Y, Yuan Y, Wang X, Lian Y, Ma G Wang . Distributed multimodal path queries. IEEE Transactions on Knowledge and Data Engineering, 2022, 34( 7): 3196–3210
2
N A H, Haldar J, Li M E, Ali T, Cai Y, Chen T, Sellis M Reynolds . Top-k socio-spatial co-engaged location selection for social users. IEEE Transactions on Knowledge and Data Engineering, 2023, 35( 5): 5325–5340
3
E W. Dijkstra . A note on two problems in connexion with graphs. Numerische Mathematik, 1959, 1: 269–271
4
D, Ouyang D, Wen L, Qin L, Chang Y, Zhang X Lin . 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
Y, Zeng Y, Tong L Chen . 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
