{"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":1771600886311,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"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":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871457","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"119-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Path-hop"],"prefix":"10.1145","author":[{"given":"Jing","family":"Cai","sequence":"first","affiliation":[{"name":"City University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"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.1137\/0201008"},{"key":"e_1_3_2_1_3_1","first-page":"493","volume-title":"Proc. of 31st VLDB","author":"Chen L.","year":"2005","unstructured":"L. Chen , A. Gupta , M. E. Kurul . Stack-based algorithms for pattern matching on DAGs . In Proc. of 31st VLDB , pp 493 -- 504 , 2005 . L. Chen, A. Gupta, M. E. Kurul. Stack-based algorithms for pattern matching on DAGs. In Proc. of 31st VLDB, pp 493--504, 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_5_1","first-page":"937","volume-title":"Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms","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 13th Annual ACM-SIAM Symposium on Discrete Algorithms , pp 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 937--946, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gki108"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2004-6-1-r2"},{"key":"e_1_3_2_1_12_1","first-page":"237","article-title":"HOPI: an efficient connection index for complex XML document collections. In 7th EDBT","volume":"2992","author":"Schenkel R.","year":"2004","unstructured":"R. Schenkel , A. Theobald , and G. Weikum . HOPI: an efficient connection index for complex XML document collections. In 7th EDBT , LNCS 2992 , pp 237 -- 255 , 2004 . R. Schenkel, A. Theobald, and G. Weikum. HOPI: an efficient connection index for complex XML document collections. In 7th EDBT, LNCS 2992, pp 237--255, 2004.","journal-title":"LNCS"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30145-5_12"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","location":"Toronto ON Canada","acronym":"CIKM '10","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871457","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:47Z","timestamp":1750244387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871457"}},"subtitle":["efficiently indexing large graphs for reachability queries"],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":15,"alternative-id":["10.1145\/1871437.1871457","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871457","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}