Schema validation and evolution for graph databases - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Schema validation and evolution for graph databases

Peter Furniss
  • Function : Author
Alastair Green
  • Function : Author
Russ Harmer
Hannes Voigt
  • Function : Author


Despite the maturity of commercial graph databases, little consensus has been reached so far on the standardization of data definition languages (DDLs) for property graphs (PG). Discussion on the characteristics of PG schemas is ongoing in many standardization and community groups. Although some basic aspects of a schema are already present in most commercial graph databases, full support is missing allowing to constraint property graphs with more or less flexibility. In this paper, we show how schema validation can be enforced through homomorphisms between PG schemas and PG instances by leveraging a concise schema DDL inspired by Cypher syntax. We also briefly discuss PG schema evolution that relies on graph rewriting operations allowing to consider both prescriptive and descriptive schemas.
Fichier principal
Vignette du fichier
main.pdf (257.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02138771 , version 1 (25-09-2020)



Angela Bonifati, Peter Furniss, Alastair Green, Russ Harmer, Eugenia Oshurko, et al.. Schema validation and evolution for graph databases. ER 2019 - 38th International Conference on Conceptual Modeling, Nov 2019, Salvador, Brazil. pp.448-456, ⟨10.1007/978-3-030-33223-5_37⟩. ⟨hal-02138771⟩
1932 View
973 Download



Gmail Facebook X LinkedIn More