PG-Schema: Schemas for Property Graphs
Abstract
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.
Keywords
Cite
@article{arxiv.2211.10962,
title = {PG-Schema: Schemas for Property Graphs},
author = {Renzo Angles and Angela Bonifati and Stefania Dumbrava and George Fletcher and Alastair Green and Jan Hidders and Bei Li and Leonid Libkin and Victor Marsault and Wim Martens and Filip Murlak and Stefan Plantikow and Ognjen Savković and Michael Schmidt and Juan Sequeda and Sławek Staworko and Dominik Tomaszuk and Hannes Voigt and Domagoj Vrgoč and Mingxi Wu and Dušan Živković},
journal= {arXiv preprint arXiv:2211.10962},
year = {2023}
}
Comments
26 pages