{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:26:49Z","timestamp":1779316009876,"version":"3.51.4"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) under the Artificial Intelligence Convergence Innovation Human Resources Development","award":["IITP-2023-RS-2023-00255968"],"award-info":[{"award-number":["IITP-2023-RS-2023-00255968"]}]},{"name":"Information Technology Research Center (ITRC) Support Program"},{"name":"Korean Government","award":["IITP-2021-0-02051"],"award-info":[{"award-number":["IITP-2021-0-02051"]}]},{"DOI":"10.13039\/501100003725","name":"Basic Science Research Program through the National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","award":["NRF-2020R1I1A3052713"],"award-info":[{"award-number":["NRF-2020R1I1A3052713"]}],"id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3308684","type":"journal-article","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T17:26:22Z","timestamp":1692984382000},"page":"94043-94056","source":"Crossref","is-referenced-by-count":1,"title":["ParSCL: A Parallel and Distributed Framework to Process All Nearest Neighbor Queries on a Road Network"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2536-1713","authenticated-orcid":false,"given":"Aavash","family":"Bhandari","sequence":"first","affiliation":[{"name":"Department of Artificial Intelligence, Ajou University, Suwon-si, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1030-3844","authenticated-orcid":false,"given":"Prince","family":"Hamandawana","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence, Ajou University, Suwon-si, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7237-180X","authenticated-orcid":false,"given":"Muhammad","family":"Attique","sequence":"additional","affiliation":[{"name":"Department of Software, Sejong University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7458-8888","authenticated-orcid":false,"given":"Hyung-Ju","family":"Cho","sequence":"additional","affiliation":[{"name":"Department of Software, Kyungpook National University, Sangju-si, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-1136","authenticated-orcid":false,"given":"Tae-Sun","family":"Chung","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence, Ajou University, Suwon-si, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/s20030798"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2019.04.003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0696-9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32281-5_34"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368964"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44520-X_39"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/SSDM.2004.1311221","article-title":"All-nearest-neighbors queries in spatial databases","author":"zhang","year":"2004","journal-title":"Proc 16th Int Conf Sci Stat Database Manage"},{"key":"ref36","article-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","author":"karypis","year":"1997"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336674"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247602"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247617"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113382"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22922-0_13"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367549"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/872811.872812"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_15"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/253822"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2012.19"},{"key":"ref38","article-title":"Bsmock\/k-shortest-paths: First official major release","author":"smock","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/math9101137"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/503099.503101"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170075"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447837"},{"key":"ref25","first-page":"756","article-title":"GORDER: An efficient method for KNN join processing","volume":"30","author":"xia","year":"2004","journal-title":"Proc 13th Int Conf Very Large Data Bases"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.243"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2503768"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0235-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/426294"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi5120247"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2010.40"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref6","article-title":"Continuous nearest neighbor monitoring in road networks","author":"mouratidis","year":"2006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/s150924143"},{"key":"ref40","year":"2005","journal-title":"Real Datasets for Spatial Databases"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10230243.pdf?arnumber=10230243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T18:05:02Z","timestamp":1696269902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10230243\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3308684","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}