{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T08:46:00Z","timestamp":1766047560488,"version":"3.37.3"},"reference-count":91,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["16202722","T43-513\/23-N"],"award-info":[{"award-number":["16202722","T43-513\/23-N"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072125","62202116"],"award-info":[{"award-number":["62072125","62202116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou–HKUST(GZ) Joint Funding Scheme","award":["2023A03J0135"],"award-info":[{"award-number":["2023A03J0135"]}]},{"name":"Jiangsu Big Data Intelligent Lab Project","award":["#SDGC222"],"award-info":[{"award-number":["#SDGC222"]}]},{"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":[[2024,11]]},"DOI":"10.1109\/tkde.2024.3386906","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T18:26:19Z","timestamp":1712773579000},"page":"6430-6446","source":"Crossref","is-referenced-by-count":6,"title":["I\/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9680-3921","authenticated-orcid":false,"given":"Xinjie","family":"Zhou","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3385-6417","authenticated-orcid":false,"given":"Kai","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Macau University of Science and Technology, Taipa, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"Department of CSE, Hong Kong University of Science and Technology, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8155-4942","authenticated-orcid":false,"given":"Mengxuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computing, Australian National University, Canberra, ACT, Australia"}],"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 SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109623"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref4","article-title":"Optimal route planning on mobile systems","author":"Batzill","year":"2016","journal-title":"Masterarbeit, Hochschule Ravensburg-Weingarten"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2018.00567"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"ref8","first-page":"859","article-title":"On external memory graph traversal","volume-title":"Proc. 11th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Buchsbaum"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469388"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"ref12","volume-title":"Operating Systems Theory","volume":"973","author":"Coffman","year":"1973"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref14","first-page":"45","article-title":"FlashGraph: Processing billion-node graphs on an array of commodity SSDs","volume-title":"Proc. 13th USENIX Conf. File Storage Technol.","author":"Da Zheng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/spe.844"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517862"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517883"},{"issue":"1","key":"ref20","first-page":"4","article-title":"Visualizing social networks","volume":"1","author":"Freeman","year":"2000","journal-title":"J. Social Struct."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-01655-x"},{"key":"ref24","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. 17th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00087"},{"issue":"116","key":"ref26","first-page":"5781","article-title":"On the longest common subsequence problem","volume":"6","author":"Gorbenko","year":"2012","journal-title":"Appl. Math. Sci."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"1","key":"ref33","first-page":"24","article-title":"Multiplex network mining: A brief survey","volume":"16","author":"Kanawati","year":"2015","journal-title":"IEEE Intell. Informat. Bull."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1996.570330"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137638"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00085"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981062"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0499-4"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551856"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00760-2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_63"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_49"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1216585"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447851"},{"key":"ref56","first-page":"687","article-title":"I\/O-complexity of graph algorithms","volume-title":"Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Munagala"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.275"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2015.00059"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_16"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2017.40"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872814"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.05.109"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623653"},{"key":"ref67","volume-title":"Database System Concepts","volume":"5","author":"Silberschatz","year":"2002"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/2615569.2615687"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v22i1.13495"},{"key":"ref70","first-page":"58","article-title":"Impact of similarity measures on web-page clustering","volume-title":"Proc. Workshop Artif. Intell. Web Search","author":"Strehl"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2908384"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213872"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/2666310.2666401"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.6011"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9096-4"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00156-1"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452826"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882938"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547566"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12079-5_1"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3010005"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476267"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-69377-0_14"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723740"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"},{"key":"ref91","first-page":"375","article-title":"GridGraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Zhu"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10709365\/10496202.pdf?arnumber=10496202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T11:24:18Z","timestamp":1728559458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10496202\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":91,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3386906","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":[[2024,11]]}}}