PG-Schemas: Schemas for Property Graphs

Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savković, Michael Schmidt, Juan Sequeda, Slawek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoc, Mingxi WuDusan Zivkovic

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Property graphs have reached a high level of maturity, witnessed by multiple robust graph database systems as well as the ongoing ISO standardization effort aiming at creating a new standard Graph Query Language (GQL). Yet, despite documented demand, schema support is limited both in existing systems and in the first version of the GQL Standard. It is anticipated that the second version of the GQL Standard will include a rich DDL. Aiming to inspire the development of GQL and enhance the capabilities of graph database systems, we propose PG-Schema, a simple yet powerful formalism for specifying property graph schemas. It features PG-Types with flexible type definitions supporting multi-inheritance, as well as expressive constraints based on the recently proposed PG-Keys formalism. We provide the formal syntax and semantics of PG-Schema, which meet principled design requirements grounded in contemporary property graph management scenarios, and offer a detailed comparison of its features with those of existing schema languages and graph database systems.
Original languageEnglish
Article number198
Pages (from-to)1-25
JournalProceedings of the ACM on Management of Data
Volume1
Issue number2
DOIs
Publication statusPublished - 20 Jun 2023
EventACM SIGMOD International Conference on Management of Data 2023 - Seattle, United States
Duration: 18 Jun 202323 Jun 2023
https://2023.sigmod.org/index.shtml

Keywords / Materials (for Non-textual outputs)

  • property graphs
  • schemas
  • graph databases

Fingerprint

Dive into the research topics of 'PG-Schemas: Schemas for Property Graphs'. Together they form a unique fingerprint.

Cite this