113 (147)
Querying RDF Graphs
- In practice, more complex queries into the RDF data are necessary
- The fundamental idea: generalize the approach of graph patterns:
- the pattern contains unbound symbols
- by binding the symbols, subgraphs of the RDF graph may be matched
- if there is such a match, the query returns the bound resources
- This is the goal of SPARQL (Query Language for RDF)
- based on similar systems that already exist, e.g., in Jena
- is programming language-independent query language
-
still in a working draft phase
- Recommendation early 2006?
SPARQL