| Link from here | Target |
|---|
| rdf:type | swc:Poster |
| swrc:author | person:bastian-quilitz |
| swrc:author | person:christian-rothe |
| swrc:author | person:ralf-heese |
| swrc:author | person:ulf-leser |
| dc:title | Index Support for SPARQL |
| rdfs:label | Index Support for SPARQL |
| swrc:keywords | SPARQL |
| swrc:abstract | The Resource Description Framework (RDF) is the fundamental data model underlying the Semantic Web. Recently, SPARQL has been proposed as a W3C standard for querying RDF repositories. As RDF is a graph-based data model, the core problem of evaluating SPARQL queries is matching query graph patterns against a data graph, a process which is computationally very expensive. We propose to save some of the cost by indexing graph patterns. In the spirit of SQL, we assume that users select the patterns to be indexed. We formally define the problem of covering indexes, i.e., finding those indexes whose graph-patterns are contained in the query pattern, and derive formulas for estimating index selectivity. Finally, we study the problem of finding optimal sets of indexes for a given query. We believe that our framework is the first suggestion for indexing RDF for SPARQL queries that goes beyond simple indexing of labels. |
| swc:uuid | e8f4c774-ef32-4a5c-a164-0d5550c7f3b7 |
| swrc:keywords | index selection |
| swrc:keywords | query optimization |
Explore this resource elsewhere:
