{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:28:49Z","timestamp":1786602529115,"version":"build-2736575974"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Natural Science Foundation of China","award":["62572414"],"award-info":[{"award-number":["62572414"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/icde65706.2026.00149","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:24:05Z","timestamp":1786562645000},"page":"1968-1980","source":"Crossref","is-referenced-by-count":0,"title":["iKSP: A Path Enumeration Index in Road Networks"],"prefix":"10.1109","author":[{"given":"Zihan","family":"Luo","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou)","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou)","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengxuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University","place":["Canberra, Australia"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinjie","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou)","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zizhuo","family":"Xu","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou)","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology","place":["Hong Kong SAR, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref2","article-title":"Efficiently computing top-k shortest path join","author":"Chang","year":"2015","journal-title":"EDBT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389735"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595916500421"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2017.2773492"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00604-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00350"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29038-1_41"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00194"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3439409"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.06.003"},{"key":"ref13","first-page":"53","article-title":"Finding diverse shortest paths for the routing task in wireless sensor networks","volume-title":"Proc. ICSNC","author":"Henao-Mazo","year":"2012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0061-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0010-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871504"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9154"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.05.109"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564705"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2005.9"},{"key":"ref24","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybern."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/10719839_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"ref28","volume-title":"xxhash"},{"key":"ref29","volume-title":"9th dimacs implementation challenge - shortest paths"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444019"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_52"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_23"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551856"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00760-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00322"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.07.004"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539795290477"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3483955"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3396173"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00058"},{"key":"ref43","first-page":"1213","article-title":"Indoor top-k keywordaware routing query","author":"Feng","year":"2020","journal-title":"ICDE. IEEE"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00035"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-025-00940-w"},{"key":"ref46","first-page":"1470","article-title":"Evaluating topk meta path queries on large heterogeneous information networks","author":"Zhu","year":"2018","journal-title":"ICDM. IEEE"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts212"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767844"}],"event":{"name":"2026 IEEE 42nd International Conference on Data Engineering (ICDE)","location":"Montreal, QC, Canada","start":{"date-parts":[[2026,5,4]]},"end":{"date-parts":[[2026,5,8]]}},"container-title":["2026 IEEE 42nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11629178\/11629165\/11629231.pdf?arnumber=11629231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:00:16Z","timestamp":1786600816000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00149","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}