Abstract
ShEx (Shape Expressions) is a language for expressing constraints on RDF graphs. We consider the problem of SPARQL query containment in the presence of ShEx constraints. We first propose a sound and complete procedure for the problem of containment with ShEx, considering several SPARQL fragments. Particularly our procedure considers OPTIONAL query patterns, that turns out to be an important fragment to be studied with schemas. We then show the complexity bounds of our problem with respect to the fragments considered. To the best of our knowledge, this is the first work addressing SPARQL query containment in the presence of ShEx constraints.
Cite
CITATION STYLE
Abbas, A., Genevès, P., Roisin, C., & Layaïda, N. (2017). SPARQL query containment with ShEx constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10509 LNCS, pp. 343–356). Springer Verlag. https://doi.org/10.1007/978-3-319-66917-5_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
