Conference ProceedingsOPEN ACCESS

Semantics and complexity of SPARQL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4273 LNCS 30-43
DOI: 10.1007/11926078_3
372Citations
Citations of this article
283Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

SPARQL is the W3C candidate recommendation query language for RDF. In this paper we address systematically the formal study of SPARQL, concentrating in its graph pattern facility. We consider for this study simple RDF graphs without special semantics for literals and a simplified version of filters which encompasses all the main issues. We provide a compositional semantics, prove there are normal forms, prove complexity bounds, among others that the evaluation of SPARQL patterns is PSPACE-complete, compare our semantics to an alternative operational semantics, give simple and natural conditions when both semantics coincide and discuss optimization procedures. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Pérez, J., Arenas, M., & Gutierrez, C. (2006). Semantics and complexity of SPARQL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4273 LNCS, pp. 30–43). Springer Verlag. https://doi.org/10.1007/11926078_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free