{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:21:26Z","timestamp":1771600886916,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465286","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":95,"title":["TF-Label"],"prefix":"10.1145","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Silu","family":"Huang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Huanhuan","family":"Wu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367611"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871457"},{"key":"e_1_3_2_1_4_1","first-page":"493","volume-title":"VLDB","author":"Chen L.","year":"2005","unstructured":"L. Chen , A. Gupta , and M. E. Kurul . Stack-based algorithms for pattern matching on DAGs . In VLDB , pages 493 -- 504 , 2005 . L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on DAGs. In VLDB, pages 493--504, 2005."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767832"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350247"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_56"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353370"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"e_1_3_2_1_14_1","first-page":"937","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In SODA , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002."},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen , C. Leiserson , R. Rivest , and C. Stein . Introduction to algorithms . MIT press , 2001 . T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. MIT press, 2001."},{"key":"e_1_3_2_1_16_1","unstructured":"A. W.-C. Fu H. Wu J. Cheng and R. C.-W. Wong. Is-label: an independent-set based labeling scheme for point-to-point distance querying. PVLDB.  A. W.-C. Fu H. Wu J. Cheng and R. C.-W. Wong. Is-label: an independent-set based labeling scheme for point-to-point distance querying. PVLDB."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213856"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929934.1929941"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_22_1","volume-title":"ICDE","author":"Seufert S.","year":"2012","unstructured":"S. Seufert , A. Anand , S. J. Bedathur , and G. Weikum . Ferrari: Flexible and efficient reachability range assignment for graph indexing . In ICDE , 2012 . S. Seufert, A. Anand, S. J. Bedathur, and G. Weikum. Ferrari: Flexible and efficient reachability range assignment for graph indexing. In ICDE, 2012."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90032-1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989419"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"issue":"1","key":"e_1_3_2_1_28_1","first-page":"276","article-title":"Grail: Scalable reachability index for large graphs","volume":"3","author":"Yildirim H.","year":"2010","unstructured":"H. Yildirim , V. Chaoji , and M. J. Zaki . Grail: Scalable reachability index for large graphs . PVLDB , 3 ( 1 ): 276 -- 284 , 2010 . H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1):276--284, 2010.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_6"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465286","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:05Z","timestamp":1750235945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465286"}},"subtitle":["a topological-folding labeling scheme for reachability querying in a large graph"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":29,"alternative-id":["10.1145\/2463676.2465286","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465286","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}