ProGS: Property Graph Shapes Language
ProGS: Property Graph Shapes Language
Knowledge graphs such asWikidata 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 metadata 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.
Seifer, Philipp
cf4777a9-262b-4de1-bda4-46e4a989bfbc
Lämmel, Ralf
88466e78-a512-4c70-ad31-7d50c4006b7f
Staab, Steffen
bf48d51b-bd11-4d58-8e1c-4e6e03b30c49
Seifer, Philipp
cf4777a9-262b-4de1-bda4-46e4a989bfbc
Lämmel, Ralf
88466e78-a512-4c70-ad31-7d50c4006b7f
Staab, Steffen
bf48d51b-bd11-4d58-8e1c-4e6e03b30c49
Seifer, Philipp, Lämmel, Ralf and Staab, Steffen
(2021)
ProGS: Property Graph Shapes Language.
20th International Semantic Web Conference, Virtual Event.
24 - 28 Oct 2021.
17 pp
.
(In Press)
Record type:
Conference or Workshop Item
(Paper)
Abstract
Knowledge graphs such asWikidata 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 metadata 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.
Text
crc-Query_Validation_ISWC_2021_submission (5)
- Accepted Manuscript
More information
Accepted/In Press date: 2021
Venue - Dates:
20th International Semantic Web Conference, Virtual Event, 2021-10-24 - 2021-10-28
Identifiers
Local EPrints ID: 450455
URI: http://eprints.soton.ac.uk/id/eprint/450455
PURE UUID: 3d0f9972-26be-4cba-960d-f56730b90820
Catalogue record
Date deposited: 28 Jul 2021 16:32
Last modified: 17 Mar 2024 03:38
Export record
Contributors
Author:
Philipp Seifer
Author:
Ralf Lämmel
Author:
Steffen Staab
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics