Semantics and Complexity of SPARQL

Details Semantics and Complexity of SPARQL Semantics and Complexity of SPARQL

2006-05-26

arxiv.org/abs/cs/0605124v1

Computer Science

Databases

Scientific paper

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 a fragment without literals and a simple version of filters which encompasses all the main issues yet is simple to formalize. 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 optimizations procedures.

Affiliated with

Also associated with

No associations

Rating

Semantics and Complexity of SPARQL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semantics and Complexity of SPARQL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semantics and Complexity of SPARQL will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-238391