{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:46:40Z","timestamp":1762015600500,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["1-ZE26"],"award-info":[{"award-number":["1-ZE26"]}],"id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100001641","name":"GRF","doi-asserted-by":"publisher","award":["152196\/16E"],"award-info":[{"award-number":["152196\/16E"]}],"id":[{"id":"10.13039\/100001641","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Hong Kong RGC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61332004"],"award-info":[{"award-number":["61332004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University\u2019s Support for Application of Major Research Funding"},{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["1-BBA1"],"award-info":[{"award-number":["1-BBA1"]}],"id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373036"],"award-info":[{"award-number":["61373036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012242","name":"Program of Shanghai Subject Chief Scientist","doi-asserted-by":"crossref","award":["15XD1503600"],"award-info":[{"award-number":["15XD1503600"]}],"id":[{"id":"10.13039\/501100012242","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Projects of Fundamental Research Program of Shanghai Municipal Commission of Science and Technology","award":["14JC1400300"],"award-info":[{"award-number":["14JC1400300"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,10,1]]},"DOI":"10.1109\/tkde.2017.2721408","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T15:43:22Z","timestamp":1498751002000},"page":"2182-2196","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Retrieval of Bounded-Cost Informative Routes"],"prefix":"10.1109","volume":"29","author":[{"given":"Wengen","family":"Li","sequence":"first","affiliation":[]},{"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Jihong","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Man Lung","family":"Yiu","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"437","article-title":"Identifying and describing streets of interest","author":"skoutas","year":"2016","journal-title":"Proc Int Conf Extending Database Technol"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544888"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11535331_16","article-title":"On trip planning queries in spatial databases","author":"li","year":"2005","journal-title":"Advances in Spatial and Temporal Databases"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.05.006"},{"key":"ref31","first-page":"46:1","article-title":"An arc orienteering algorithm to find the most scenic path on a large-scale road network","author":"lu","year":"2015","journal-title":"Proc ACM SIGSPATIAL Int Conf Adv Geographic Inf Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732946"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525342"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1183471.1183501"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463448"},{"key":"ref34","first-page":"765","article-title":"The optimal sequenced route query","volume":"17","author":"sharifzadeh","year":"2008","journal-title":"Journal Proc VLDB Endowment"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.05.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"ref13","first-page":"87","article-title":"Efficient and scalable method for processing top-k spatial boolean queries","author":"cary","year":"2010","journal-title":"Proc Int Conf Sci Statist Database Manage"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247617"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113289"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"ref18","first-page":"901","article-title":"Inverted linear quadtree: Efficient top k spatial keyword search","author":"zhang","year":"2013","journal-title":"Proc IEEE Int Conf Data Eng"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447897"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063979"},{"key":"ref4","first-page":"2118","article-title":"Optimal route search with the coverage of users’ preferences","author":"zeng","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350230"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18123-3_13"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631799"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536266"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39937-9_9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525370"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350234"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2772600"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989363"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723723"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2477837"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465275"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SKG.2012.27"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2324897"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8031002\/07962258.pdf?arnumber=7962258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:40:27Z","timestamp":1641987627000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7962258\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,1]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2721408","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2017,10,1]]}}}