{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T04:50:29Z","timestamp":1762145429284,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARC","award":["DP180103411","FT180100140"],"award-info":[{"award-number":["DP180103411","FT180100140"]}]},{"name":"MOE","award":["Tier-1 RG83\/16","NTU M4081678"],"award-info":[{"award-number":["Tier-1 RG83\/16","NTU M4081678"]}]},{"name":"Australian Government RTP Scholarship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,5,1]]},"DOI":"10.1109\/tkde.2019.2894140","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T03:48:03Z","timestamp":1548128883000},"page":"983-997","source":"Crossref","is-referenced-by-count":16,"title":["K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1053-2193","authenticated-orcid":false,"given":"Tenindra","family":"Abeywickrama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2139-9121","authenticated-orcid":false,"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7312-6312","authenticated-orcid":false,"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.243"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767861"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"ref15","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref16","first-page":"425","article-title":"Efficient landmark-based candidate generation for kNN queries on road networks","author":"abeywickrama","year":"2017","journal-title":"Proc Int Conf Database Syst Adv Appl"},{"key":"ref17","first-page":"39","article-title":"G-tree: An efficient index for KNN search on road networks","author":"zhong","year":"2013","journal-title":"Proc Int Conf Inf Knowl Manage"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498297"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399306"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536217"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247617"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"year":"2015","author":"sterling","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0271-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749447"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609562"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2912572"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.64"},{"journal-title":"Foundations of Multidimensional and Metric Data Structures","year":"2005","author":"samet","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1097064.1097093"},{"year":"2018","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904125"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"year":"2018","key":"ref25"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9055295\/08620331.pdf?arnumber=8620331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:53Z","timestamp":1651070513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8620331\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,1]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2894140","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2020,5,1]]}}}