GPC: A Pattern Calculus for Property Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908639232524288 |
|---|---|
| author | Francis, Nadime Gheerbrant, Amélie Guagliardo, Paolo Libkin, Leonid Marsault, Victor Martens, Wim Murlak, Filip Peterfreund, Liat Rogova, Alexandra Vrgoč, Domagoj |
| author_facet | Francis, Nadime Gheerbrant, Amélie Guagliardo, Paolo Libkin, Leonid Marsault, Victor Martens, Wim Murlak, Filip Peterfreund, Liat Rogova, Alexandra Vrgoč, Domagoj |
| contents | The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an extension of the SQL Standard for querying property graphs represented by a relational schema, called SQL/PGQ. The main component of both is the pattern matching facility, which is shared by the two standards. In many aspects, it goes well beyond RPQs, CRPQs, and similar queries on which the research community has focused for years. Our main contribution is to distill the lengthy standard specification into a simple Graph Pattern Calculus (GPC) that reflects all the key pattern matching features of GQL and SQL/PGQ, and at the same time lends itself to rigorous theoretical investigation. We describe the syntax and semantics of GPC, along with the typing rules that ensure its expressions are well-defined, and state some basic properties of the language. With this paper we provide the community a tool to embark on a study of query languages that will soon be widely adopted by industry. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_16580 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | GPC: A Pattern Calculus for Property Graphs Francis, Nadime Gheerbrant, Amélie Guagliardo, Paolo Libkin, Leonid Marsault, Victor Martens, Wim Murlak, Filip Peterfreund, Liat Rogova, Alexandra Vrgoč, Domagoj Databases The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an extension of the SQL Standard for querying property graphs represented by a relational schema, called SQL/PGQ. The main component of both is the pattern matching facility, which is shared by the two standards. In many aspects, it goes well beyond RPQs, CRPQs, and similar queries on which the research community has focused for years. Our main contribution is to distill the lengthy standard specification into a simple Graph Pattern Calculus (GPC) that reflects all the key pattern matching features of GQL and SQL/PGQ, and at the same time lends itself to rigorous theoretical investigation. We describe the syntax and semantics of GPC, along with the typing rules that ensure its expressions are well-defined, and state some basic properties of the language. With this paper we provide the community a tool to embark on a study of query languages that will soon be widely adopted by industry. |
| title | GPC: A Pattern Calculus for Property Graphs |
| topic | Databases |
| url | https://arxiv.org/abs/2210.16580 |