{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:10:55Z","timestamp":1765437055987,"version":"3.45.0"},"reference-count":31,"publisher":"Tech Science Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2025.065334","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T03:15:10Z","timestamp":1749438910000},"page":"3217-3240","source":"Crossref","is-referenced-by-count":1,"title":["PAV-A-<i>k<\/i>NN: A Novel Approachable <i>k<\/i>NN Query Method in Road Network Environments"],"prefix":"10.32604","volume":"84","author":[{"given":"Kailai","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Weikang","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Jiatai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.14778\/1453856.1453973","article-title":"The V*-Diagram: a query-dependent approach to moving KNN queries","volume":"1","author":"Sarana","year":"2008","journal-title":"Proc VLDB Endow"},{"key":"ref2","series-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE)","first-page":"1298","article-title":"An efficient framework for correctness-aware kNN queries on road networks","author":"He","year":"2019 Apr 8\u201311"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3390\/a15070223","article-title":"The efficient processing of moving k-farthest neighbor queries in road networks","volume":"15","author":"Cho","year":"2022","journal-title":"Algorithms"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-030-39469-1_3","author":"Li","year":"2020","journal-title":"Databases theory and applications"},{"key":"ref5","series-title":"2017 IEEE 33rd International Conference on Data Engineering (ICDE)","first-page":"609","article-title":"V-tree: efficient kNN search on moving objects with road-network constraints","author":"Shen","year":"2017 Apr 19\u201322"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"3402","DOI":"10.14778\/3681954.3682009","article-title":"Efficient kNN search in public transportation networks","volume":"17","author":"Feng","year":"2024","journal-title":"Proc VLDB Endow"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"183609","DOI":"10.1007\/s11704-023-3626-3","article-title":"Graph-decomposed k-NN searching algorithm on road network","volume":"18","author":"Jiang","year":"2024","journal-title":"Front Comput Sci"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s11280-024-01248-5","article-title":"Efficient processing of coverage centrality queries on road networks","volume":"27","author":"Xu","year":"2024","journal-title":"World Wide Web"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"102256","DOI":"10.1016\/j.is.2023.102256","article-title":"The partition bridge (PB) tree: efficient nearest neighbor query processing on road networks","volume":"118","author":"Min","year":"2023","journal-title":"Inf Syst"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer Math"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","article-title":"G-tree: an efficient and scalable index for spatial search on road networks","volume":"27","author":"Zhong","year":"2015","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref12","series-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE)","first-page":"268","article-title":"G*-tree: an efficient spatial index on road networks","author":"Li","year":"2019 Apr 8\u201311"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.14778\/3407790.3407822","author":"Li","year":"2020","journal-title":"vLDB endowment"},{"key":"ref14","series-title":"Proceedings of the International Conference on Automated Planning and Scheduling","first-page":"2","article-title":"Hierarchical graph traversal for aggregate k nearest neighbors search in road networks","author":"Abeywickrama","year":"2020 Jun 14\u201319"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/3187009.3177736","article-title":"Toain: a throughput optimizing adaptive index for answering dynamic knn queries on road networks","volume":"11","author":"Luo","year":"2018","journal-title":"Proc VLDB Endow"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/TKDE.2019.2942585","article-title":"GLAD: a grid and labeling framework with scheduling for conflict-aware kNN queries","volume":"33","author":"He","year":"2021","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","author":"Geisberger","year":"2008","journal-title":"Experimental Algorithms"},{"key":"ref18","series-title":"Proceedings of the 2018 International Conference on Management of Data","first-page":"709","article-title":"When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks","author":"Ouyang","year":"2018"},{"key":"ref19","series-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","first-page":"1781","article-title":"Progressive top-K nearest neighbors search in large road networks","author":"Ouyang","year":"2020"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"Wang Y, Yuan L, Zhang W, Lin X, Chen Z, Liu Q. Simpler is more: efficient top-K nearest neighbors search on large road networks. arXiv:2408.05432, 2024.","DOI":"10.14778\/3704965.3704975"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.14778\/3015274.3015277","article-title":"Effective indexing for approximate constrained shortest path queries on large road networks","volume":"10","author":"Wang","year":"2016","journal-title":"Proc VLDB Endow"},{"key":"ref22","series-title":"Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"998","article-title":"Efficient single-source shortest path and distance queries on large graphs","author":"Zhu","year":"2013"},{"key":"ref23","series-title":"2022 International Conference on Smart Generation Computing, Communication and Networking (SMART GENCON)","first-page":"1","article-title":"A novel shortest path problem using dijkstra algorithm in interval-valued neutrosophic environment","author":"Singh","year":"2022 Dec 23\u201325"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"3082","DOI":"10.14778\/3681954.3681985","article-title":"PCSP: efficiently answering label-constrained shortest path queries in road networks","volume":"17","author":"Wang","year":"2024","journal-title":"Proc VLDB Endow"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"770","DOI":"10.14778\/3712221.3712241","article-title":"A CPU-GPU hybrid labelling algorithm for massive shortest distance queries on road networks","volume":"18","author":"Li","year":"2024","journal-title":"Proc VLDB Endow"},{"key":"ref26","series-title":"Proceedings of the 2021 International Conference on Management of Data. Virtual Event","first-page":"313","article-title":"P2H: efficient distance querying on road networks by projected vertex separators","author":"Chen","year":"2021"},{"key":"ref27","series-title":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","first-page":"624","article-title":"Experimental evaluation of indexing techniques for shortest distance queries on road networks","author":"Anirban","year":"2023 Apr 3\u20137"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"23721","DOI":"10.1109\/TITS.2022.3203432","article-title":"LG-tree: an efficient labeled index for shortest distance search on massive road networks","volume":"23","author":"Dan","year":"2022","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"ref29","series-title":"2021 IEEE 37th International Conference on Data Engineering (ICDE)","first-page":"360","article-title":"A learning-based method for computing shortest path distances on road networks","author":"Huang","year":"2021 Apr 19\u201322"},{"key":"ref30","series-title":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","first-page":"1678","article-title":"Reinforcement learning based tree decomposition for distance querying in road networks","author":"Zheng","year":"2023 Apr 3\u20137"},{"key":"ref31","series-title":"Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods","first-page":"386","article-title":"Applying the neural bellman-ford model to the single source shortest path problem","author":"Drakakis","year":"2024 Feb 24\u201326"}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/cdn.techscience.cn\/files\/cmc\/2025\/TSP_CMC-84-2\/TSP_CMC_65334\/TSP_CMC_65334.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T01:51:52Z","timestamp":1763344312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v84n2\/62913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":31,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2025.065334","relation":{},"ISSN":["1546-2226"],"issn-type":[{"type":"electronic","value":"1546-2226"}],"subject":[],"published":{"date-parts":[[2025]]}}}