{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:47:56Z","timestamp":1761518876240,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T00:00:00Z","timestamp":1206403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["418206"],"award-info":[{"award-number":["418206"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,25]]},"DOI":"10.1145\/1353343.1353370","type":"proceedings-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T16:11:28Z","timestamp":1207066288000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Fast computing reachability labelings for large graphs with high compression rate"],"prefix":"10.1145","author":[{"given":"Jiefeng","family":"Cheng","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, China"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, China"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[{"name":"T. J. Watson Research Center, IBM"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago"}]}],"member":"320","published-online":{"date-parts":[[2008,3,25]]},"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\/775152.775249"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050083"},{"key":"e_1_3_2_1_4_1","volume-title":"Resource Description Framework (RDF) Schema Specification 1.0. W3C Candidate Recommendation","author":"Brickley D.","year":"2000","unstructured":"D. Brickley and R. V. Guha . Resource Description Framework (RDF) Schema Specification 1.0. W3C Candidate Recommendation , 2000 . D. Brickley and R. V. Guha. Resource Description Framework (RDF) Schema Specification 1.0. W3C Candidate Recommendation, 2000."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of VLDB'05","author":"Chen L.","year":"2005","unstructured":"L. Chen , A. Gupta , and M. E. Kurul . Stack-based algorithms for pattern matching on dags . In Proc. of VLDB'05 , 2005 . L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In Proc. of VLDB'05, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_56"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of SODA'02","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In Proc. of SODA'02 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of SODA'02, 2002."},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_9_1","volume-title":"XML linking language (XLink) version 1.0","author":"DeRose S.","year":"2001","unstructured":"S. DeRose , E. Maler , and D. Orchard . XML linking language (XLink) version 1.0 . 2001 . S. DeRose, E. Maler, and D. Orchard. XML linking language (XLink) version 1.0. 2001."},{"key":"e_1_3_2_1_10_1","volume-title":"XML pointer language (XPointer) version 1.0","author":"DeRose S.","year":"2001","unstructured":"S. DeRose , E. Maler , and D. Orchard . XML pointer language (XPointer) version 1.0 . 2001 . S. DeRose, E. Maler, and D. Orchard. XML pointer language (XPointer) version 1.0. 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/262762.262763"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099708"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215033"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804034"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/107004.107032"},{"key":"e_1_3_2_1_16_1","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"Knuth D. E.","year":"1993","unstructured":"D. E. Knuth . The Stanford GraphBase: a platform for combinatorial computing . ACM Press , 1993 . D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM Press, 1993."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007387"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.57"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of VLDB'02","author":"Schmidt A.","year":"2002","unstructured":"A. Schmidt , F. Waas , M. Kersten , M. J. Carey , I. Manolescu , and R. Busse . Xmark: A benchmark for xml data management . In Proc. of VLDB'02 , 2002 . A. Schmidt, F. Waas, M. Kersten, M. J. Carey, I. Manolescu, and R. Busse. Xmark: A benchmark for xml data management. In Proc. of VLDB'02, 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_22_1","author":"van Helden J.","year":"2000","unstructured":"J. van Helden , A. Naim , R. Mancuso , M. Eldridge , L. Wernisch , D. Gilbert , and S. Wodak . Reresenting and analysing molecular and cellular function using the computer. Journal of Biological Chemistry, 381(9--10) , 2000 . J. van Helden, A. Naim, R. Mancuso, M. Eldridge, L. Wernisch, D. Gilbert, and S. Wodak. Reresenting and analysing molecular and cellular function using the computer. Journal of Biological Chemistry, 381(9--10), 2000.","journal-title":"Journal of Biological Chemistry, 381(9--10)"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"}],"event":{"name":"EDBT '08: 11th International Conference on Extending Database Technology","acronym":"EDBT '08","location":"Nantes France"},"container-title":["Proceedings of the 11th international conference on Extending database technology: Advances in database technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353343.1353370","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1353343.1353370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:16Z","timestamp":1750253956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353343.1353370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,25]]},"references-count":23,"alternative-id":["10.1145\/1353343.1353370","10.1145\/1353343"],"URL":"https:\/\/doi.org\/10.1145\/1353343.1353370","relation":{},"subject":[],"published":{"date-parts":[[2008,3,25]]},"assertion":[{"value":"2008-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}