{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:55Z","timestamp":1750220995922,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T00:00:00Z","timestamp":1561852800000},"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":[[2019,6,30]]},"DOI":"10.1145\/3327964.3328494","type":"proceedings-article","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T12:05:45Z","timestamp":1560945945000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph Traversals for Regular Path Queries"],"prefix":"10.1145","author":[{"given":"Frank","family":"Tetzel","sequence":"first","affiliation":[{"name":"Database Systems Group, TU Dresden, Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romans","family":"Kasperovics","sequence":"additional","affiliation":[{"name":"SAP SE, Walldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Database Systems Group, TU Dresden, Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190654"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272743.1272747"},{"volume-title":"Regular Path Queries on Large Graphs","author":"Koschmieder Andr\u00e9","key":"e_1_3_2_1_3_1","unstructured":"Andr\u00e9 Koschmieder and Ulf Leser . 2012. Regular Path Queries on Large Graphs . Springer , 177--194. Andr\u00e9 Koschmieder and Ulf Leser. 2012. Regular Path Queries on Large Graphs. Springer, 177--194."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_1_5_1","unstructured":"W3C. 2013. SPARQL 1.1 Overview. http:\/\/www.w3.org\/TR\/2013\/REC-sparql11-overview-20130321\/.  W3C. 2013. SPARQL 1.1 Overview. http:\/\/www.w3.org\/TR\/2013\/REC-sparql11-overview-20130321\/."}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3327964.3328494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3327964.3328494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:33Z","timestamp":1750206333000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3327964.3328494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,30]]},"references-count":5,"alternative-id":["10.1145\/3327964.3328494","10.1145\/3327964"],"URL":"https:\/\/doi.org\/10.1145\/3327964.3328494","relation":{},"subject":[],"published":{"date-parts":[[2019,6,30]]},"assertion":[{"value":"2019-06-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}