SPARQL CONSTRUCT queries allow for the specification of data processing pipelines that transform given input graphs into new output graphs. It is now common to constrain graphs through SHACL shapes allowing users to understand which data they can expect and which not. However, it becomes challenging to understand what graph data can be expected at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be imposed by the query template. In this paper, we study the derivation of shape constraints that hold on all possible output graphs of a given SPARQL CONSTRUCT query. We assume that the SPARQL CONSTRUCT query is fixed, e.g., being part of a program, whereas the input graphs adhere to input shape constraints but may otherwise vary over time and, thus, are mostly unknown. We study a fragment of SPARQL CONSTRUCT queries (SCCQ) and a fragment of SHACL (Simple SHACL). We formally define the problem of deriving the most restrictive set of Simple SHACL shapes that constrain the results from evaluating a SCCQ over any input graph restricted by a given set of Simple SHACL shapes. We propose and implement an algorithm that statically analyses input SHACL shapes and CONSTRUCT queries and prove its soundness and complexity.
%0 Conference Paper
%1 seifer2024shapes
%A Seifer, Philipp
%A Hernández, Daniel
%A Lämmel, Ralf
%A Staab, Steffen
%B Proceedings of the ACM Web Conference 2024 (WWW '24), May13--17, 2024, Singapore, Singapore
%D 2024
%I ACM
%K peer rp20
%R 10.1145/3589334.3645550
%T From Shapes to Shapes: Inferring SHACL Shapes for Results of SPARQL CONSTRUCT Queries
%U https://doi.org/10.1145/3589334.3645550
%X SPARQL CONSTRUCT queries allow for the specification of data processing pipelines that transform given input graphs into new output graphs. It is now common to constrain graphs through SHACL shapes allowing users to understand which data they can expect and which not. However, it becomes challenging to understand what graph data can be expected at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be imposed by the query template. In this paper, we study the derivation of shape constraints that hold on all possible output graphs of a given SPARQL CONSTRUCT query. We assume that the SPARQL CONSTRUCT query is fixed, e.g., being part of a program, whereas the input graphs adhere to input shape constraints but may otherwise vary over time and, thus, are mostly unknown. We study a fragment of SPARQL CONSTRUCT queries (SCCQ) and a fragment of SHACL (Simple SHACL). We formally define the problem of deriving the most restrictive set of Simple SHACL shapes that constrain the results from evaluating a SCCQ over any input graph restricted by a given set of Simple SHACL shapes. We propose and implement an algorithm that statically analyses input SHACL shapes and CONSTRUCT queries and prove its soundness and complexity.
%@ 979-8-4007-0171-9/24/05
@inproceedings{seifer2024shapes,
abstract = {SPARQL CONSTRUCT queries allow for the specification of data processing pipelines that transform given input graphs into new output graphs. It is now common to constrain graphs through SHACL shapes allowing users to understand which data they can expect and which not. However, it becomes challenging to understand what graph data can be expected at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be imposed by the query template. In this paper, we study the derivation of shape constraints that hold on all possible output graphs of a given SPARQL CONSTRUCT query. We assume that the SPARQL CONSTRUCT query is fixed, e.g., being part of a program, whereas the input graphs adhere to input shape constraints but may otherwise vary over time and, thus, are mostly unknown. We study a fragment of SPARQL CONSTRUCT queries (SCCQ) and a fragment of SHACL (Simple SHACL). We formally define the problem of deriving the most restrictive set of Simple SHACL shapes that constrain the results from evaluating a SCCQ over any input graph restricted by a given set of Simple SHACL shapes. We propose and implement an algorithm that statically analyses input SHACL shapes and CONSTRUCT queries and prove its soundness and complexity.},
added-at = {2024-02-21T10:24:48.000+0100},
author = {Seifer, Philipp and Hernández, Daniel and Lämmel, Ralf and Staab, Steffen},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/236c7d34fd7fc291d83447fa5215a882e/intcdc},
booktitle = {Proceedings of the ACM Web Conference 2024 (WWW '24), May13--17, 2024, Singapore, Singapore},
doi = {10.1145/3589334.3645550},
eventdate = {May 13–17, 2024},
eventtitle = {WWW '24},
interhash = {0bf82d6c48341304519f2d57b3d89e28},
intrahash = {36c7d34fd7fc291d83447fa5215a882e},
isbn = {979-8-4007-0171-9/24/05},
keywords = {peer rp20},
month = may,
preprinturl = {https://arxiv.org/abs/2402.08509},
publisher = {ACM},
timestamp = {2024-02-21T10:24:48.000+0100},
title = {From Shapes to Shapes: Inferring SHACL Shapes for Results of SPARQL CONSTRUCT Queries},
url = {https://doi.org/10.1145/3589334.3645550},
venue = {Singapore},
year = 2024
}
