Containment of Shape Expression Schemas for RDF
Slawek Staworko, Piotr Wieczorek

TL;DR
This paper investigates the containment problem for shape expression schemas (ShEx) in RDF graphs, identifying a tractable subclass and analyzing the computational complexity of the problem.
Contribution
It introduces a graphical subclass of ShEx with tractable containment checking and provides complexity bounds for the general case.
Findings
Containment is EXP-hard and in coNEXP for shape graphs.
A graphical subclass of ShEx allows tractable containment checks.
Containment for arbitrary ShEx is coNEXP-hard and in coTwoNEXP^NP.
Abstract
We study the problem of containment for shape expression schemas (ShEx) for RDF graphs. We identify a subclass of ShEx that has a natural graphical representation in the form of shape graphs and their semantics is captured with a tractable notion of embedding of an RDF graph in a shape graph. When applied to pairs of shape graphs, an embedding is a sufficient condition for containment, and for a practical subclass of deterministic shape graphs, it is also a necessary one, thus yielding a subclass with tractable containment. While for general shape graphs a minimal counter-example i.e., an instance proving non-containment, might be of exponential size, we show that containment is EXP-hard and in coNEXP. Finally, we show that containment for arbitrary ShEx is coNEXP-hard and in coTwoNEXP^NP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
