{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:15:00Z","timestamp":1787012100033,"version":"build-2736575974"},"reference-count":79,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/icde55515.2023.00013","type":"proceedings-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T13:51:13Z","timestamp":1690379473000},"page":"67-81","source":"Crossref","is-referenced-by-count":7,"title":["A Reachability Index for Recursive Label-Concatenated Graph Queries"],"prefix":"10.1109","author":[{"given":"Chao","family":"Zhang","sequence":"first","affiliation":[{"name":"Lyon 1 University,Lyon,France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angela","family":"Bonifati","sequence":"additional","affiliation":[{"name":"Lyon 1 University,Lyon,France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Kapp","sequence":"additional","affiliation":[{"name":"Oracle Labs,Z&#x00FC;rich,Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vlad Ioan","family":"Haprian","sequence":"additional","affiliation":[{"name":"Oracle Labs,Z&#x00FC;rich,Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Pierre","family":"Lozi","sequence":"additional","affiliation":[{"name":"Inria,Paris,France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539702403098"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2006.53"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2008.4497498"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465286"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"ref12","first-page":"493","article-title":"Stack-based algorithms for pattern matching on dags","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases, ser. VLDB \u201905","author":"Chen"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2013.6544893"},{"key":"ref16","first-page":"511","article-title":"Reachability queries in very large graphs: A fast refined online search approach","volume-title":"EDBT","author":"Veloso"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732992"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2016.2631160"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612181"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871457"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505724"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"ref23","first-page":"47","article-title":"Efficient processing of label-constraint reachability queries in large graphs","volume-title":"Information Systems","volume":"40","author":"Zou","year":"2014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035955"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380753"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3451159"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313472"},{"key":"ref28","article-title":"Neo4j"},{"key":"ref29","article-title":"TigerGraph: A native mpp graph database","author":"Deutsch","year":"2019"},{"key":"ref30","article-title":"Graph query language gql standard"},{"key":"ref31","article-title":"Apache TinkerPop data system providers"},{"key":"ref32","article-title":"Amazon Neptune: Graph data management in the cloud","volume-title":"ISWC (P&D\/Industry\/BlueSky), ser. CEUR Workshop Proceedings","volume":"2180","author":"Bebee"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807620"},{"key":"ref35","first-page":"209","article-title":"aDFS: An almost depth-first-search distributed graph-querying system","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Trigonakis"},{"key":"ref36","article-title":"Virtuoso"},{"key":"ref37","article-title":"Apache Jena"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3434642"},{"key":"ref39","article-title":"A reachability index for recursive label-concatenated graph queries","author":"Zhang","year":"2022"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2004.75"},{"key":"ref43","first-page":"69","article-title":"VF2++\u2014An improved subgraph isomorphism algorithm","volume-title":"Discrete Applied Mathematics","volume":"242","author":"J\u00fcttner","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2017.2696940"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.2980257"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425888"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397241"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"ref61","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01864-0","volume-title":"Querying Graphs","author":"Bonifati","year":"2018"},{"key":"ref62","first-page":"185","article-title":"Finding regular simple paths in graph databases","volume-title":"Proceedings of the 15th International Conference on Very Large Data Bases, ser. VLDB \u201989","author":"Mendelzon"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319882"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465216"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2011.5767858"},{"key":"ref69","first-page":"636","article-title":"Efficient regular path query evaluation using path indexes","volume-title":"EDBT","author":"Fletcher"},{"key":"ref70","first-page":"582","article-title":"Path indexing in the cypher query pipeline","volume-title":"EDBT","author":"Kuijpers"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350248"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389733"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/icde53745.2022.00025"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140403"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref76","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2016.2633993"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3381449"}],"event":{"name":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","location":"Anaheim, CA, USA","start":{"date-parts":[[2023,4,3]]},"end":{"date-parts":[[2023,4,7]]}},"container-title":["2023 IEEE 39th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10184508\/10184509\/10184548.pdf?arnumber=10184548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T09:35:23Z","timestamp":1709285723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10184548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":79,"URL":"https:\/\/doi.org\/10.1109\/icde55515.2023.00013","relation":{},"subject":[],"published":{"date-parts":[[2023,4]]}}}