SPARQL - Beyond Subgraph Matching
- Speaker: Dr Birte Glimm (Oxford University)
- Host: Bijan Parsia
- 2nd December 2009 at 14:15 in Lecture Theatre 1.4, Kilburn Building
In this talk, I introduce SPARQL as a semantic web query language with a particular focus on the current W3C standardisation effort for SPARQL with different entailment regimes. With SPARQL one can query data that is available as a set of RDF triples. Traditionally, the triples are viewed as a graph and the query answers are computed by matching a graph pattern from the query onto the RDF graph. Computing the query answers corresponds, therefore, to a subgraph matching problem. The corresponding semantics is called simple entailment. I will introduce the basics of standard SPARQL queries and then go on to describe how SPARQL can be extended to different entailment regimes. In particular for the web ontology language OWL, the view of RDF triples is quite different and an extension of SPARQL is non-trivial. I will outline the current proposal for SPARQL with OWL and RDF(S) entailment and illustrate some of the problems and the proposed solutions.