2026-07-22T11:04:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17743 2024-03-06T11:00:22Z ddc:004 open_access

A Researcher’s Digest of GQL (Invited Talk) Francis, Nadime Gheerbrant, Amélie Guagliardo, Paolo Libkin, Leonid Marsault, Victor Martens, Wim Murlak, Filip Peterfreund, Liat Rogova, Alexandra Vrgoč, Domagoj GQL Property Graph Query Language Graph Database Pattern matching Multi-Graph GQL (Graph Query Language) is being developed as a new ISO standard for graph query languages to play the same role for graph databases as SQL plays for relational. In parallel, an extension of SQL for querying property graphs, SQL/PGQ, is added to the SQL standard; it shares the graph pattern matching functionality with GQL. Both standards (not yet published) are hard-to-understand specifications of hundreds of pages. The goal of this paper is to present a digest of the language that is easy for the research community to understand, and thus to initiate research on these future standards for querying graphs. The paper concentrates on pattern matching features shared by GQL and SQL/PGQ, as well as querying facilities of GQL. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nadime Francis and Amélie Gheerbrant and Paolo Guagliardo and Leonid Libkin and Victor Marsault and Wim Martens and Filip Murlak and Liat Peterfreund and Alexandra Rogova and Domagoj Vrgoč 2023 Is Part Of LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICDT.2023.1 urn:nbn:de:0030-drops-177434 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.1 eng https://creativecommons.org/licenses/by/4.0/legalcode