Paper Info
Title
ProGS: Property Graph Shapes Language
Abstract
Knowledge graphs such as Wikidata are created by a diversity of contributors and a range of sources leaving them prone to two types of errors. The first type of error, falsity of facts, is addressed by property graphs through the representation of provenance and validity, making triples occur as first-order objects in subject position of meta-data triples. The second type of error, violation of domain constraints, has not been addressed with regard to property graphs so far. In RDF representations, this error can be addressed by shape languages such as SHACL or ShEx, which allow for checking whether graphs are valid with respect to a set of domain constraints. Borrowing ideas from the syntax and semantics definitions of SHACL, we design a shape language for property graphs, ProGS, which allows for formulating shape constraints on property graphs including their specific constructs, such as edges with identities and key-value annotations to both nodes and edges. We define a formal semantics of ProGS, investigate the resulting complexity of validating property graphs against sets of ProGS shapes, compare with corresponding results for SHACL, and implement a prototypical validator that utilizes answer set programming.
Year
DOI
Venue
2021
10.1007/978-3-030-88361-4_23
SEMANTIC WEB - ISWC 2021
Keywords
DocType
Volume
Property graphs, Graph validation, SHACL
Conference
12922
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
7
3
Name
Order
Citations
PageRank
Philipp Seifer111.39
Ralf Lammel2485.77
Steffen Staab36658593.89