{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T03:48:12Z","timestamp":1784692092987,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T00:00:00Z","timestamp":1445904000000},"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":[[2015,10,27]]},"DOI":"10.1145\/2815072.2815082","type":"proceedings-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T20:02:09Z","timestamp":1446580929000},"page":"69-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Typing regular path query languages for data graphs"],"prefix":"10.1145","author":[{"given":"Dario","family":"Colazzo","sequence":"first","affiliation":[{"name":"Paris Dauphine University, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlo","family":"Sartiani","sequence":"additional","affiliation":[{"name":"University of Basilicata, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Dblp bibliographic database http:\/\/dblp.l3s.de\/d2r.  Dblp bibliographic database http:\/\/dblp.l3s.de\/d2r."},{"key":"e_1_3_2_1_2_1","unstructured":"Cypher. http:\/\/neo4j.com\/docs\/stable\/cypher-query -lang.html.  Cypher. http:\/\/neo4j.com\/docs\/stable\/cypher-query -lang.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Pql. http:\/\/wiki.infinitegraph.com\/3.4\/w\/index.php ?title=PQL\/Getting Started with PQL.  Pql. http:\/\/wiki.infinitegraph.com\/3.4\/w\/index.php ?title=PQL\/Getting Started with PQL."},{"key":"e_1_3_2_1_4_1","volume-title":"XML Path Language (XPath) 2.0","author":"Berglund A.","year":"2010","unstructured":"A. Berglund , S. Boag , D. Chamberlin , M. F. Fern\u00e1ndez , M. Kay , J. Robie , and J. Sim\u00e9on . XML Path Language (XPath) 2.0 ( Second Edition). Technical report, World Wide Web Consortium , 2010 . W3C Recommendation. A. Berglund, S. Boag, D. Chamberlin, M. F. Fern\u00e1ndez, M. Kay, J. Robie, and J. Sim\u00e9on. XML Path Language (XPath) 2.0 (Second Edition). Technical report, World Wide Web Consortium, 2010. W3C Recommendation."},{"key":"e_1_3_2_1_5_1","volume-title":"Extensible Markup Language (XML) 1.1","author":"Bray T.","year":"2006","unstructured":"T. Bray , J. Paoli , C. M. Sperberg-McQueen , E. Maler , F. Yergeau , and J. Cowan . Extensible Markup Language (XML) 1.1 ( Second Edition). Technical report, World Wide Web Consortium , 2006 . W3C Recommendation. T. Bray, J. Paoli, C. M. Sperberg-McQueen, E. Maler, F. Yergeau, and J. Cowan. Extensible Markup Language (XML) 1.1 (Second Edition). Technical report, World Wide Web Consortium, 2006. W3C Recommendation."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335207"},{"key":"e_1_3_2_1_7_1","first-page":"48","volume-title":"WebDB","author":"Choi B.","year":"2002","unstructured":"B. Choi . What are real DTDs like ? In WebDB , pages 43\u2013 48 , 2002 . B. Choi. What are real DTDs like? In WebDB, pages 43\u201348, 2002."},{"key":"e_1_3_2_1_8_1","volume-title":"ICPS - Universit\u00e9 Louis Pasteur, Strasbourg, sep","author":"Clauss P.","year":"1998","unstructured":"P. Clauss . Advances in parameterized linear diophantine equations for precise program analysis. Technical report , ICPS - Universit\u00e9 Louis Pasteur, Strasbourg, sep 1998 . {ICPS RR 98-02}. P. Clauss. Advances in parameterized linear diophantine equations for precise program analysis. Technical report, ICPS - Universit\u00e9 Louis Pasteur, Strasbourg, sep 1998. {ICPS RR 98-02}."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.10.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.023"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508020.2508022"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54345-7_57"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783534.1783557"},{"key":"e_1_3_2_1_15_1","volume-title":"SPARQL 1.1 Query Language. Technical report","author":"Harris S.","year":"2013","unstructured":"S. Harris and A. Seaborne . SPARQL 1.1 Query Language. Technical report , World Wide Web Consortium , Mar 2013 . W3C Recommendation. S. Harris and A. Seaborne. SPARQL 1.1 Query Language. Technical report, World Wide Web Consortium, Mar 2013. W3C Recommendation."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448513"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2010.01.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624562.1624616"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_1_22_1","volume-title":"Logical number theory. 1., an introduction. Universitext","author":"Smoryski C. A.","year":"1991","unstructured":"C. A. Smoryski . Logical number theory. 1., an introduction. Universitext . Springer-Verlag , Berlin, New York, 1991 . ISBN 3-540-52236-0. C. A. Smoryski. Logical number theory. 1., an introduction. Universitext. Springer-Verlag, Berlin, New York, 1991. ISBN 3-540-52236-0."},{"key":"e_1_3_2_1_23_1","volume-title":"ICDT","author":"Staworko S.","year":"2015","unstructured":"S. Staworko , I. Boneva , J. E. L. Gayo , S. Hym , E. G. Prud\u2019hommeaux , and H. R. Solbrig . Complexity and expressiveness of ShEx for RDF . In ICDT , 2015 . S. Staworko, I. Boneva, J. E. L. Gayo, S. Hym, E. G. Prud\u2019hommeaux, and H. R. Solbrig. Complexity and expressiveness of ShEx for RDF. In ICDT, 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"XML Schema Part 1: Structures","author":"Thompson H. S.","year":"2004","unstructured":"H. S. Thompson , D. Beech , M. Maloney , and N. Mendelsohn . XML Schema Part 1: Structures Second Edition. Technical report, World Wide Web Consortium , Oct 2004 . W3C Recommendation. H. S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML Schema Part 1: Structures Second Edition. Technical report, World Wide Web Consortium, Oct 2004. W3C Recommendation."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759276"}],"event":{"name":"SPLASH '15: Conference on Systems, Programming, Languages, and Applications: Software for Humanity","location":"Pittsburgh PA USA","acronym":"SPLASH '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th Symposium on Database Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815072.2815082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2815072.2815082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:36Z","timestamp":1750225716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815072.2815082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,27]]},"references-count":25,"alternative-id":["10.1145\/2815072.2815082","10.1145\/2815072"],"URL":"https:\/\/doi.org\/10.1145\/2815072.2815082","relation":{},"subject":[],"published":{"date-parts":[[2015,10,27]]},"assertion":[{"value":"2015-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}