{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T15:47:07Z","timestamp":1786636027157,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"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":[[2023,6,4]]},"DOI":"10.1145\/3555041.3589408","type":"proceedings-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T16:25:14Z","timestamp":1685982314000},"page":"61-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An Overview of Reachability Indexes on Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4972-9380","authenticated-orcid":false,"given":"Chao","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-869X","authenticated-orcid":false,"given":"Angela","family":"Bonifati","sequence":"additional","affiliation":[{"name":"Lyon 1 University, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8126-1717","authenticated-orcid":false,"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263676"},{"key":"e_1_3_2_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2010.11.002"},{"key":"e_1_3_2_3_5_1","doi-asserted-by":"publisher","unstructured":"Angela Bonifati George Fletcher Hannes Voigt Nikolay Yakovets and H. V. Jagadish. 2018. Querying Graphs. Morgan & Claypool Publishers. https:\/\/doi.org\/10.2200\/S00873ED1V01Y201808DTM051","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"e_1_3_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313472"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.117"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871457"},{"key":"e_1_3_2_3_9_1","first-page":"1083651","article-title":"Stack-Based Algorithms for Pattern Matching on DAGs. In Proc. 31st","volume":"5555","author":"Chen Li","year":"2005","unstructured":"Li Chen, Amarnath Gupta, and M. Erdem Kurul. 2005. Stack-Based Algorithms for Pattern Matching on DAGs. In Proc. 31st Int. Conf. on Very Large Data Bases. 493--504. https:\/\/dl.acm.org\/doi\/10.5555\/1083592.1083651","journal-title":"Int. Conf. on Very Large Data Bases. 493--504. https:\/\/dl.acm.org\/doi\/10."},{"key":"e_1_3_2_3_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529348"},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451159"},{"key":"e_1_3_2_3_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465286"},{"key":"e_1_3_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_3_15_1","unstructured":"Klyne Graham J. Carroll Jeremy and McBride Brian. 2014. RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation. (25 Feb. 2014). https:\/\/www.w3.org\/TR\/rdf11-concepts."},{"key":"e_1_3_2_3_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418294"},{"key":"e_1_3_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"},{"key":"e_1_3_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3556540"},{"key":"e_1_3_2_3_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492668"},{"key":"e_1_3_2_3_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"e_1_3_2_3_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"e_1_3_2_3_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392745"},{"key":"e_1_3_2_3_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213856"},{"key":"e_1_3_2_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929934.1929941"},{"key":"e_1_3_2_3_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"e_1_3_2_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_3_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_3_28_1","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2020.00034"},{"key":"e_1_3_2_3_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--73197--7_52"},{"key":"e_1_3_2_3_30_1","volume-title":"White Paper: Neo4j for Financial Services. https:\/\/neo4j.com\/whitepapers\/financial-services-neo4j.","author":"Mathur Nav","year":"2021","unstructured":"Nav Mathur. 2021. White Paper: Neo4j for Financial Services. https:\/\/neo4j.com\/whitepapers\/financial-services-neo4j."},{"key":"e_1_3_2_3_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--44777--2_58"},{"key":"e_1_3_2_3_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso"},{"key":"e_1_3_2_3_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380753"},{"key":"e_1_3_2_3_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.82"},{"key":"e_1_3_2_3_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007387"},{"key":"e_1_3_2_3_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_3_2_3_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00548-x"},{"key":"e_1_3_2_3_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434642"},{"key":"e_1_3_2_3_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.57"},{"key":"e_1_3_2_3_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"e_1_3_2_3_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2631160"},{"key":"e_1_3_2_3_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_3_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_3_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035955"},{"key":"e_1_3_2_3_45_1","volume-title":"Proc. 17th Int. Conf. on Extending Database Technology. 511--522","author":"Veloso Ren\u00ea Rodrigues","year":"2014","unstructured":"Ren\u00ea Rodrigues Veloso, Lo\"i c Cerf, Wagner Meira Jr., and Mohammed J. Zaki. 2014. Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach. In Proc. 17th Int. Conf. on Extending Database Technology. 511--522. https:\/\/openproceedings.org\/EDBT\/2014\/paper_166.pdf"},{"key":"e_1_3_2_3_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732992"},{"key":"e_1_3_2_3_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0468--3"},{"key":"e_1_3_2_3_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063807"},{"key":"e_1_3_2_3_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505724"},{"key":"e_1_3_2_3_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"},{"key":"e_1_3_2_3_51_1","volume-title":"Zaki","author":"Yildirim Hilmi","year":"2013","unstructured":"Hilmi Yildirim, Vineet Chaoji, and Mohammed J. Zaki. 2013. DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs. arxiv: 1301.0977"},{"key":"e_1_3_2_3_52_1","volume-title":"Vlad Ioan Haprian, and Jean-Pierre Lozi","author":"Zhang Chao","year":"2022","unstructured":"Chao Zhang, Angela Bonifati, Hugo Kapp, Vlad Ioan Haprian, and Jean-Pierre Lozi. 2022. A Reachability Index for Recursive Label-Concatenated Graph Queries. arxiv: 2203.08606"},{"key":"e_1_3_2_3_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3108433"},{"key":"e_1_3_2_3_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035927"},{"key":"e_1_3_2_3_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612181"},{"key":"e_1_3_2_3_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.003"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Companion of the 2023 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555041.3589408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555041.3589408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:58Z","timestamp":1750272238000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555041.3589408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":56,"alternative-id":["10.1145\/3555041.3589408","10.1145\/3555041"],"URL":"https:\/\/doi.org\/10.1145\/3555041.3589408","relation":{},"subject":[],"published":{"date-parts":[[2023,6,4]]},"assertion":[{"value":"2023-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}