Graph Pattern Matching in GQL and SQL/PGQ
Abstract
As graph databases become widespread, the International Organization for Standardization (ISO) and International Electrotechnical Commission (IEC) have approved a project to create GQL, a standard property graph query language. This complements the SQL/PGQ project, which specifies how to define graph views over a SQL tabular schema, and to run read-only queries against them. Both projects have been assigned to the ISO/IEC JTC1 SC32 working group for Database Languages, WG3, which continues to maintain and enhance SQL as a whole. This common responsibility helps enforce a policy that the identical core of both PGQ and GQL is a graph pattern matching sub-language, here termed GPML. The WG3 design process is also analyzed by an academic working group, part of the Linked Data Benchmark Council (LDBC), whose task is to produce a formal semantics of these graph data languages, which complements their standard specifications. This paper, written by members of WG3 and LDBC, presents the key elements of the GPML of SQL/PGQ and GQL in advance of the publication of these new standards.
Más información
| Título según WOS: | Graph Pattern Matching in GQL and SQL/PGQ |
| Título según SCOPUS: | Graph Pattern Matching in GQL and SQL/PGQ |
| Título de la Revista: | Proceedings of the ACM SIGMOD International Conference on Management of Data |
| Editorial: | Association for Computing Machinery |
| Fecha de publicación: | 2022 |
| Página final: | 2258 |
| Idioma: | English |
| DOI: |
10.1145/3514221.3526057 |
| Notas: | ISI, SCOPUS |