{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:38:03Z","timestamp":1778279883917,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANID","award":["ICN17_002,1221799"],"award-info":[{"award-number":["ICN17_002,1221799"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0015,ANR-18-CE40-0031,ANR- 19-CE48-0019"],"award-info":[{"award-number":["ANR-21-CE48-0015,ANR-18-CE40-0031,ANR- 19-CE48-0019"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["431183758"],"award-info":[{"award-number":["431183758"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Poland's National Science Centre","award":["2018\/30\/E\/ST6\/00042"],"award-info":[{"award-number":["2018\/30\/E\/ST6\/00042"]}]},{"name":"EPSRC","award":["N023056,S003800"],"award-info":[{"award-number":["N023056,S003800"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588662","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"241-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["GPC: A Pattern Calculus for Property Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4531-7435","authenticated-orcid":false,"given":"Nadime","family":"Francis","sequence":"first","affiliation":[{"name":"LIGM, Universit\u00e9 Gustave Eiffel, CNRS, Champs-sur-Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8936-9829","authenticated-orcid":false,"given":"Am\u00e9lie","family":"Gheerbrant","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0756-5787","authenticated-orcid":false,"given":"Paolo","family":"Guagliardo","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-2735","authenticated-orcid":false,"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[{"name":"University of Edinburgh &amp; RelationalAI, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2325-6004","authenticated-orcid":false,"given":"Victor","family":"Marsault","sequence":"additional","affiliation":[{"name":"LIGM, Universit\u00e9 Gustave Eiffel, CNRS, Champs-sur-Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9480-3522","authenticated-orcid":false,"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"University of Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0989-3717","authenticated-orcid":false,"given":"Filip","family":"Murlak","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4788-0944","authenticated-orcid":false,"given":"Liat","family":"Peterfreund","sequence":"additional","affiliation":[{"name":"LIGM, Universit\u00e9 Gustave Eiffel, CNRS, Champs-sur-Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3824-445X","authenticated-orcid":false,"given":"Alexandra","family":"Rogova","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF &amp; Data Intelligence Institute of Paris (diiP), Inria, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5854-2652","authenticated-orcid":false,"given":"Domagoj","family":"Vrgoc","sequence":"additional","affiliation":[{"name":"PUC Chile &amp; IMFD, Santiago de Chile, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"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\/3104031"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Pablo Barcel\u00f3 Baeza. 2013. Querying graph databases. In PODS. ACM 175--188.","DOI":"10.1145\/2463664.2465216"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.08.006"},{"key":"e_1_3_2_1_5_1","article-title":"Expressive languages for path queries over graph-structured data","volume":"37","author":"Pablo Barcel\u00f3","year":"2012","unstructured":"Pablo Barcel\u00f3 , Leonid Libkin, Anthony Widjaja Lin, and Peter T. Wood. 2012a. Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. , Vol. 37, 4 (2012), 31:1--31:46.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_3_2_1_6_1","volume-title":"Relative Expressiveness of Nested Regular Expressions. In AMW (CEUR Workshop Proceedings","volume":"195","author":"Barcel\u00f3 Pablo","unstructured":"Pablo Barcel\u00f3, Jorge P\u00e9 rez, and Juan L. Reutter. 2012b. Relative Expressiveness of Nested Regular Expressions. In AMW (CEUR Workshop Proceedings, Vol. 866). CEUR-WS.org, 180--195."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Mikolaj Bojanczyk Claire David Anca Muscholl Thomas Schwentick and Luc Segoufin. 2006. Two-variable logic on data trees and XML reasoning. In PODS. ACM 10--19.","DOI":"10.1145\/1142351.1142354"},{"key":"e_1_3_2_1_8_1","volume-title":"Modern Graph Theory","author":"Bollob\u00e1s B\u00e9la","unstructured":"B\u00e9la Bollob\u00e1s. 2013. Modern Graph Theory. Vol. 184. Springer Science & Business Media."},{"key":"e_1_3_2_1_9_1","volume-title":"Maurizio Lenzerini, and Moshe Y. Vardi.","author":"Calvanese Diego","year":"2000","unstructured":"Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2000. Containment of Conjunctive Regular Path Queries with Inverse. In KR. Morgan Kaufmann, 176--185."},{"key":"e_1_3_2_1_10_1","volume-title":"Mendelzon","author":"Consens Mariano P.","year":"1990","unstructured":"Mariano P. Consens and Alberto O. Mendelzon. 1990. GraphLog: A Visual Formalism for Real Life Recursion. In PODS. ACM Press, 404--416."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Marco Console Paolo Guagliardo Leonid Libkin and Etienne Toussaint. 2020. Coping with Incomplete Data: Recent Advances. In PODS. ACM 33--47.","DOI":"10.1145\/3375395.3387970"},{"key":"e_1_3_2_1_12_1","volume-title":"Wood","author":"Cruz Isabel F.","year":"1987","unstructured":"Isabel F. Cruz, Alberto O. Mendelzon, and Peter T. Wood. 1987. A Graphical Query Language Supporting Recursion. In SIGMOD Conference. ACM Press, 323--330."},{"key":"e_1_3_2_1_13_1","volume-title":"Graph Pattern Matching in GQL and SQL\/PGQ. In SIGMOD Conference. ACM, 2246--2258","author":"Deutsch Alin","year":"2022","unstructured":"Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, and Fred Zemke. 2022. Graph Pattern Matching in GQL and SQL\/PGQ. In SIGMOD Conference. ACM, 2246--2258."},{"key":"e_1_3_2_1_14_1","volume-title":"Aggregation Support for Modern Graph Analytics in TigerGraph. In SIGMOD Conference. ACM, 377--392","author":"Deutsch Alin","unstructured":"Alin Deutsch, Yu Xu, Mingxi Wu, and Victor E. Lee. 2020. Aggregation Support for Modern Graph Analytics in TigerGraph. In SIGMOD Conference. ACM, 377--392."},{"key":"e_1_3_2_1_15_1","volume-title":"Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, and Domagoj Vrgovc.","author":"Francis Nadime","year":"2023","unstructured":"Nadime Francis, Am\u00e9 lie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, and Domagoj Vrgovc. 2023. A Researcher's Digest of GQL. In ICDT (LIPIcs, Vol. 255). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 1:1--1:22."},{"key":"e_1_3_2_1_16_1","volume-title":"Cypher: An Evolving Query Language for Property Graphs. In SIGMOD Conference. ACM, 1433--1445","author":"Francis Nadime","year":"2018","unstructured":"Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, and Andr\u00e9 s Taylor. 2018. Cypher: An Evolving Query Language for Property Graphs. In SIGMOD Conference. ACM, 1433--1445."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2850413"},{"key":"e_1_3_2_1_19_1","volume-title":"STACS (LIPIcs","volume":"16","author":"Martens Wim","year":"2020","unstructured":"Wim Martens, Matthias Niewerth, and Tina Trautner. 2020. A Trichotomy for Regular Trail Queries. In STACS (LIPIcs, Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 7:1--7:16."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_1_21_1","unstructured":"openCypher. 2017. Cypher Query Language Reference Version 9. https:\/\/github.com\/opencypher\/openCypher\/blob\/master\/docs\/openCypher9.pdf"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9676-2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Oskar van Rest Sungpack Hong Jinha Kim Xuming Meng and Hassan Chafi. 2016. PGQL: a property graph query language. In GRADES. ACM 7.","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_1_24_1","unstructured":"Wikipedia contributors. 2020. GQL Graph Query Language. https:\/\/en.wikipedia.org\/wiki\/GQL_Graph_Query_Language"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"}],"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":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588662","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:28Z","timestamp":1750178788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":24,"alternative-id":["10.1145\/3584372.3588662","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588662","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}