{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T23:44:41Z","timestamp":1787615081438,"version":"build-2736575974"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tkde.2020.2981062","type":"journal-article","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T21:59:31Z","timestamp":1584568771000},"page":"1-1","source":"Crossref","is-referenced-by-count":25,"title":["Fastest Path Query Answering using Time-Dependent Hop-Labeling in Road Network"],"prefix":"10.1109","author":[{"given":"Lei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9341-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MIPRO.2015.7160436"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9714-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref15","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00118"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942585"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.71"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/srep04001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137638"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0407-z"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3231541.3231545"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00085"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0499-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_25"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbp057"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti116"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623653"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1186\/1741-7015-9-87"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749456"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00086"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339491"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12079-5_1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09040652.pdf?arnumber=9040652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:28:09Z","timestamp":1704839289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9040652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.2981062","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}