{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:18:09Z","timestamp":1775261889276,"version":"3.50.1"},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":304,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["NRF-2016R1A2B4009793"],"award-info":[{"award-number":["NRF-2016R1A2B4009793"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2016R1D1A1B03934129"],"award-info":[{"award-number":["2016R1D1A1B03934129"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>\n                    A top\u2010\n                    <jats:italic>k<\/jats:italic>\n                    spatial keyword (T\n                    <jats:italic>k<\/jats:italic>\n                    Sk) query ranks objects based on the distance to the query location and textual relevance to the query keywords. Several solutions have been proposed for top\u2010\n                    <jats:italic>k<\/jats:italic>\n                    spatial keyword queries. However, most of the studies focus on Euclidean space or only investigate the snapshot queries where both the query and data object are static. A few algorithms study T\n                    <jats:italic>k<\/jats:italic>\n                    Sk queries in undirected road networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, T\n                    <jats:italic>k<\/jats:italic>\n                    Sk queries have not been thoroughly investigated in directed and dynamic spatial networks where each edge has a particular orientation and its weight changes according to the traffic conditions. Therefore, in this study, we address this problem by presenting a new method, called COSK, for processing continuous top\u2010k spatial keyword queries for moving queries in directed and dynamic road networks. We first propose an efficient framework to process snapshot T\n                    <jats:italic>k<\/jats:italic>\n                    SK queries. Furthermore, we propose a safe\u2010exit\u2010based approach to monitor the validity of the results for moving T\n                    <jats:italic>k<\/jats:italic>\n                    SK queries. Our experimental results demonstrate that COSK significantly outperforms existing techniques in terms of query processing time and communication cost.\n                  <\/jats:p>","DOI":"10.1155\/2018\/7373286","type":"journal-article","created":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T19:54:53Z","timestamp":1541102093000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Processing of Moving Top\u2010\n                    <i>k<\/i>\n                    Spatial Keyword Queries in Directed and Dynamic Road Networks"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7237-180X","authenticated-orcid":false,"given":"Muhammad","family":"Attique","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7458-8888","authenticated-orcid":false,"given":"Hyung-Ju","family":"Cho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-1136","authenticated-orcid":false,"given":"Tae-Sun","family":"Chung","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2018,11]]},"reference":[{"key":"e_1_2_12_1_2","doi-asserted-by":"crossref","unstructured":"PapadiasD. MamoulisN. ZhangJ. andTaoY. Query processing in spatial network databases Proceedings of the 29th International Conference on Very Large Data Bases (VLDB \u203203) September 2003 802\u2013813 2-s2.0-85012217314.","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.008"},{"key":"e_1_2_12_3_2","unstructured":"TsatsanifosG.andVlachouA. On processing Top-k spatio-textual preference queries Proceedings of the 18th International Conference on Extending Database Technology (EDBT \u203215) March 2015 433\u2013444 2-s2.0-84959534154."},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733100"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_12_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_12_7_2","doi-asserted-by":"crossref","unstructured":"ZhouY. XieX. WangC. GongY. andMaW. Hybrid index structures for location-based web search Proceedings of the 14th ACM International Conference on Information and Knowledge Management October 2005 Bremen Germany 155\u2013162 https:\/\/doi.org\/10.1145\/1099554.1099584.","DOI":"10.1145\/1099554.1099584"},{"key":"e_1_2_12_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"e_1_2_12_9_2","doi-asserted-by":"crossref","unstructured":"BeckmannN. KriegelH. SchneiderR. andSeegerB. R*-an efficient and robust access method for points and rectangles 19 Proceedings of the ACM SIGMOD International Conference on Management of Data May 1990 322\u2013331 2-s2.0-0025447750.","DOI":"10.1145\/93605.98741"},{"key":"e_1_2_12_10_2","doi-asserted-by":"crossref","unstructured":"HariharanR. HoreB. LiC. andMehrotraS. Processing spatial-keyword (sk) queries in geographic information retrieval (gir) systems Proceedings of the 19th International Conference on Scientific and Statistical Database Management (SSDBM \u203207) July 2007 https:\/\/doi.org\/10.1109\/SSDBM.2007.22.","DOI":"10.1109\/SSDBM.2007.22"},{"key":"e_1_2_12_11_2","doi-asserted-by":"crossref","unstructured":"De FelipeI. HristidisV. andRisheN. Keyword search on spatial databases Proceedings of the 24th International Conference on Data Engineering (ICDE \u203208) April 2008 656\u2013665 2-s2.0-52649181521.","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_2_12_12_2","doi-asserted-by":"crossref","unstructured":"Rocha-JuniorJ. B. GkorgkasO. JonassenS. andN\u00f8rv\u00e5gK. Efficient processing of top-k spatial keyword queries Proceedings of the International Symposium on Spatial and Temporal Databases 2011 Springer 205\u2013222 https:\/\/doi.org\/10.1007\/978-3-642-22922-0_13.","DOI":"10.1007\/978-3-642-22922-0_13"},{"key":"e_1_2_12_13_2","doi-asserted-by":"crossref","unstructured":"ZhangD. TanK.-L. andTungA. K. Scalable top-k spatial keyword search Proceedings of the 16th International Conference on Extending Database Technology 2013 359\u2013370.","DOI":"10.1145\/2452376.2452419"},{"key":"e_1_2_12_14_2","doi-asserted-by":"crossref","unstructured":"Rocha-JuniorJ. B.andN\u00f8rv\u00e5gK. Top-k spatial keyword queries on road networks Proceedings of the 15th International Conference on Extending Database Technology March 2012 Berlin Germany 168\u2013179 https:\/\/doi.org\/10.1145\/2247596.2247617.","DOI":"10.1145\/2247596.2247617"},{"key":"e_1_2_12_15_2","doi-asserted-by":"publisher","DOI":"10.3233\/MIS-2012-0146"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.10.001"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi5120247"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-011-0149-0"},{"key":"e_1_2_12_19_2","doi-asserted-by":"crossref","unstructured":"WuD. YiuM. L. JensenC. S. andCongG. Efficient continuously moving top-k spatial keyword query processing Proceedings of the IEEE International Conference on Data Engineering (ICDE \u203211) April 2011 Hannover Germany 541\u2013552 https:\/\/doi.org\/10.1109\/ICDE.2011.5767861.","DOI":"10.1109\/ICDE.2011.5767861"},{"key":"e_1_2_12_20_2","doi-asserted-by":"crossref","unstructured":"HuangW. LiG. TanK.-L. andFengJ. Efficient safe-region construction for moving top-k spatial keyword queries Proceedings of the 21st ACM International Conference on Information and Knowledge Management 2012 932\u2013941.","DOI":"10.1145\/2396761.2396879"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0204-8"},{"key":"e_1_2_12_22_2","first-page":"1831","article-title":"Continuous monitoring of top-k spatial keyword queries in road networks","volume":"31","author":"Li Y.","year":"2015","journal-title":"Journal of Information Science and Engineering"},{"key":"e_1_2_12_23_2","unstructured":"AttiqueM. KhanA. andChungT.-S. ESPAK: Top-k spatial keyword query processing in directed road networks Proceedings of the Workshops of the International Conference on Extending Database Technology and the International Conference on Database Theory (EDBT\/ICDT \u203217) March 2017 2-s2.0-85017123694."},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_2_12_25_2","doi-asserted-by":"crossref","unstructured":"AnhV. N. de KretserO. andMoffatA. Vector-space ranking with effective early termination Proceedings of the 24th Annual International ACM SIGIR Conference 2001 New Orleans LO USA 35\u201342 https:\/\/doi.org\/10.1145\/383952.383957.","DOI":"10.1145\/383952.383957"},{"key":"e_1_2_12_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_12_27_2","unstructured":"Real datasets for spatial databases https:\/\/www.cs.utah.edu\/lifeifei\/SpatialDataset.htm."},{"key":"e_1_2_12_28_2","unstructured":"Twitter https:\/\/twitter.com."},{"key":"e_1_2_12_29_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"}],"updated-by":[{"DOI":"10.1155\/2019\/6831382","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T00:00:00Z","timestamp":1563062400000}}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/7373286.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/7373286.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/7373286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:03:30Z","timestamp":1775257410000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/7373286"}},"subtitle":[],"editor":[{"given":"Ke","family":"Guan","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/7373286"],"URL":"https:\/\/doi.org\/10.1155\/2018\/7373286","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-05-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7373286"}}