Name
Abstract | ||
|---|---|---|
Given the sustained growth that we are experiencing in the number of SPARQL endpoints available, the need to be able to send federated SPARQL queries across these has also grown. To address this use case, the W3C SPARQL working group is defining a federation extension for SPARQL 1.1 which allows for combining graph patterns that can be evaluated over several endpoints within a single query. In this paper, we describe the syntax of that extension and formalize its semantics. Additionally, we describe how a query evaluation system can be implemented for that federation extension, describing some static optimization techniques and reusing a query engine used for data-intensive science, so as to deal with large amounts of intermediate and final results. Finally we carry out a series of experiments that show that our optimizations speed up the federated query evaluation process. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.websem.2012.10.001 | J. Web Sem. |
Keywords | Field | DocType |
sparql query,single query,graph pattern,federated query evaluation process,data-intensive science,query evaluation system,final result,query engine,w3c sparql,federating query,federation extension,rdf | Data mining,RDF query language,Information retrieval,Computer science,Reuse,SPARQL,Named graph,Syntax,Semantics,RDF,Speedup | Journal |
Volume | Issue | ISSN |
18 | 1 | 1570-8268 |
Citations | PageRank | References |
43 | 1.69 | 34 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Buil Aranda | 1 | 227 | 17.59 |
| Marcelo Arenas | 2 | 2618 | 193.91 |
| Óscar Corcho | 3 | 2194 | 194.44 |
| Axel Polleres | 4 | 2856 | 198.63 |