Graph-decomposed k-NN searching algorithm on road network

Wei JIANG; Bo NING; Guanyu LI; Mei BAI; Xiao JIA; Fangliang WEI

doi:10.1007/s11704-023-3626-3

Front. Comput. Sci. ›› 2024, Vol. 18 ›› Issue (3) : 183609 DOI: 10.1007/s11704-023-3626-3

Information Systems

LETTER

Graph-decomposed k-NN searching algorithm on road network

Author information +

History +

PDF (1630KB)

Graphical abstract

Cite this article

Download citation ▾

Wei JIANG, Bo NING, Guanyu LI, Mei BAI, Xiao JIA, Fangliang WEI. Graph-decomposed k-NN searching algorithm on road network. Front. Comput. Sci., 2024, 18(3): 183609 DOI:10.1007/s11704-023-3626-3

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[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