{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:42:06Z","timestamp":1756572126057,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#2030249","#1637541"],"award-info":[{"award-number":["#2030249","#1637541"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grants Council","award":["#16202722"],"award-info":[{"award-number":["#16202722"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["#62072125","#61902134"],"award-info":[{"award-number":["#62072125","#61902134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JC STEM Lab of Data Science Foundations"},{"name":"The Hong Kong Jockey Club Charities Trust"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,11,1]]},"DOI":"10.1109\/tkde.2023.3236632","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T21:58:20Z","timestamp":1673647100000},"page":"11751-11768","source":"Crossref","is-referenced-by-count":11,"title":["Parallel Hub Labeling Maintenance With High Efficiency in Dynamic Small-World Networks"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8155-4942","authenticated-orcid":false,"given":"Mengxuan","family":"Zhang","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"Thrust of DSA, Hong Kong University of Science and Technology (Guangzhou), Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8839-6278","authenticated-orcid":false,"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7001-4123","authenticated-orcid":false,"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6343-1455","authenticated-orcid":false,"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of CSE, Hong kong University of Science and Technology, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"1","article-title":"Efficient kNN query for moving objects on time-dependent road networks","author":"li","year":"2022","journal-title":"VLDB J"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372722"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0421-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00758-w"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.136"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281269"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377371"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389746"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401945"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"463","DOI":"10.14778\/3372716.3372720","article-title":"Hop-constrained st simple path enumeration: Towards bridging theory and practice","volume":"13","author":"peng","year":"2019","journal-title":"Proc VLDB Endowment"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.016105"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00085"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389718"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137638"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61350-053-8.ch009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"ref18","first-page":"300","article-title":"Fastest path query answering using time-dependent hop-labeling in road network","volume":"34","author":"li","year":"2022","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref24","first-page":"372","article-title":"Privacy preservation of affinities in social networks","author":"liu","year":"2010","journal-title":"Proc Int Conf Inf Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3010005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551856"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-022-00177-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476267"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0499-4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59419-0_16"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401984"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00694-1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319877"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"ref27","first-page":"1","article-title":"Multi-constraint shortest path using forest hop labeling","author":"liu","year":"2022","journal-title":"VLDB J"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using networkx","author":"hagberg","year":"2008","journal-title":"Proc 7th Python Sci Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00118"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3483919"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"year":"0","key":"ref40"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/10273671\/10016676-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10273671\/10016676.pdf?arnumber=10016676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T06:24:16Z","timestamp":1728714256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10016676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":48,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3236632","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":[[2023,11,1]]}}}