Talks and Poster Presentations (with Proceedings-Entry):
R. Pichler, S. Skritek:
"Containment and equivalence of well-designed SPARQL";
Talk: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems,
Snowbird, UT, USA,;
- 06-27-2014; in: "Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems",
R. Hull, M. Grohe (ed.);
Query containment and query equivalence constitute important computational problems in the context of static query analysis and optimization. While these problems have been intensively studied for fragments of relational calculus, almost no works exist for the semantic web query language SPARQL. In this paper, we carry out a comprehensive complexity analysis of containment and equivalence for several fragments of SPARQL: we start with the fundamental fragment of well-designed SPARQL restricted to the AND and OPTIONAL operator. We then study basic extensions in the form of the UNION operator and/or projection. The results obtained range from NP-completeness to undecidability.
SPARQL, RDF, Semantic Web, query containment
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Project Head Reinhard Pichler:
SEE: SPARQL Evaluation and Extensions
Created from the Publication Database of the Vienna University of Technology.