{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:53:55Z","timestamp":1740174835115,"version":"3.37.3"},"reference-count":23,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002531","name":"Kyungpook National University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002531","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Information Systems"],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:p>A<jats:italic>k<\/jats:italic>-range nearest neighbor (<jats:italic>k<\/jats:italic>RNN) query in a spatial network finds the<jats:italic>k<\/jats:italic>closest objects to each point in the query region. The essential nature of the<jats:italic>k<\/jats:italic>RNN query is significant in location-based services (LBSs), where location-aware queries with query regions such as<jats:italic>k<\/jats:italic>RNN queries are frequently used because of the issue of location privacy and the imprecision of the associated positioning techniques. Existing studies focus on reducing computation costs at the server side while processing<jats:italic>k<\/jats:italic>RNN queries. They also consider snapshot queries that are evaluated once and terminated, as opposed to moving queries that require constant updating of their results. However, little attention has been paid to evaluating moving<jats:italic>k<\/jats:italic>RNN queries in directed and dynamic spatial networks where every edge is directed and its weight changes in accordance with the traffic conditions. In this paper, we propose an efficient algorithm called MORAN that evaluates moving<jats:italic>k<\/jats:italic>-range nearest neighbor (M<jats:italic>k<\/jats:italic>RNN) queries in directed and dynamic spatial networks. The results of a simulation conducted using real-life roadmaps indicate that MORAN is more effective than a competitive method based on a shared execution approach.<\/jats:p>","DOI":"10.1155\/2016\/2406142","type":"journal-article","created":{"date-parts":[[2016,1,17]],"date-time":"2016-01-17T16:01:01Z","timestamp":1453046461000},"page":"1-17","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Processing of Moving<i>k<\/i>-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks"],"prefix":"10.1155","volume":"2016","author":[{"given":"Hyung-Ju","family":"Cho","sequence":"first","affiliation":[{"name":"Department of Software, Kyungpook National University, Gyeongsang-daero 2559, Sangju-si, Gyeongsangbuk-do 37224, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rize","family":"Jin","sequence":"additional","affiliation":[{"name":"Department of Information & Computer Engineering, Ajou University, Worldcup-ro 206, Yeongtong-gu, Suwon 16499, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02982-0_5"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-005-4575-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-008-9608-9"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2009.48"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687745"},{"first-page":"221","volume-title":"MobiHide: a mobilea peer-to-peer system for anonymous location-based queries","year":"2007","key":"13"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1670679.1670682"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1504\/ijahuc.2014.064860"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/630396"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.3233\/mis-2012-0146"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.008"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735473"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0163-0"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.10.001"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1966385.1966387"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2007.190662"},{"key":"9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-642-02982-0_19","volume-title":"Approximate evaluation of range nearest neighbor queries with quality guarantee","volume":"5644","year":"2009"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2009.65"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350231"},{"issue":"5","key":"14","first-page":"1569","volume":"30","year":"2014","journal-title":"Journal of Information Science and Engineering"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1023\/a:1015231126594"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"}],"container-title":["Mobile Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/downloads.hindawi.com\/journals\/misy\/2016\/2406142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/downloads.hindawi.com\/journals\/misy\/2016\/2406142.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/downloads.hindawi.com\/journals\/misy\/2016\/2406142.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T23:55:27Z","timestamp":1498262127000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.hindawi.com\/journals\/misy\/2016\/2406142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":23,"alternative-id":["2406142","2406142"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1155\/2016\/2406142","relation":{},"ISSN":["1574-017X","1875-905X"],"issn-type":[{"type":"print","value":"1574-017X"},{"type":"electronic","value":"1875-905X"}],"subject":[],"published":{"date-parts":[[2016]]}}}