{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T17:15:21Z","timestamp":1763572521079,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2017YFB0309800"],"award-info":[{"award-number":["2017YFB0309800"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472339","61303040","61572421","61272124"],"award-info":[{"award-number":["61472339","61303040","61572421","61272124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2956557","type":"journal-article","created":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T23:03:52Z","timestamp":1575500632000},"page":"172110-172122","source":"Crossref","is-referenced-by-count":9,"title":["$HT$ : A Novel Labeling Scheme for k-Hop Reachability Queries on DAGs"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8617-8939","authenticated-orcid":false,"given":"Ming","family":"Du","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1812-870X","authenticated-orcid":false,"given":"Anping","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6494-5319","authenticated-orcid":false,"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2311-2860","authenticated-orcid":false,"given":"Xian","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3360-4244","authenticated-orcid":false,"given":"Ziyang","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Lixin University of Accounting and Finance, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4584-4226","authenticated-orcid":false,"given":"Yanfei","family":"Zuo","sequence":"additional","affiliation":[{"name":"Histo Pathology Diagnostic Center, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035927"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0495-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00049"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324304"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319877"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350247"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0346-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319885"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915226"},{"key":"ref4","first-page":"511","article-title":"Reachability queries in very large graphs: A fast refined online search approach","author":"veloso","year":"2014","journal-title":"Proc Int Conf on Extending Database Technology (EDBT)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0256-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505724"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612181"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2631160"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465286"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2017.02.009"},{"key":"ref22","first-page":"937","article-title":"Reachability and distance queries via 2-hop labels","author":"cohen","year":"2002","journal-title":"Proc ACM-SIAM"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90032-1"},{"key":"ref24","first-page":"10","article-title":"Measuring user influence in Twitter: The million follower fallacy","author":"cha","year":"2010","journal-title":"Proc of the Int Conf on Weblogs and Social Media (ICWSM)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2278-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08917635.pdf?arnumber=8917635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:58:47Z","timestamp":1662667127000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8917635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2956557","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}