How not to lie with statistics: the correct way to summarize benchmark results
Communications of the ACM - The MIT Press scientific computation series
Federated database systems for managing distributed, heterogeneous, and autonomous databases
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
The TSIMMIS Approach to Mediation: Data Models and Languages
Journal of Intelligent Information Systems - Special issue: next generation information technologies and systems
Managing semantic heterogeneity in databases: a theoretical prospective
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Index structures and algorithms for querying distributed RDF repositories
Proceedings of the 13th international conference on World Wide Web
Foundations and Trends in Databases
Proceedings of the 17th international conference on World Wide Web
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Querying distributed RDF data sources with SPARQL
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management
SIHJoin: querying remote and local linked data
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Semantics and optimization of the SPARQL 1.1 federation extension
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Metrics for heterogeneous scientific workflows: A case study of an earthquake science application
International Journal of High Performance Computing Applications
ANAPSID: an adaptive query processing engine for SPARQL endpoints
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
FedBench: a benchmark suite for federated semantic data query processing
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
FedX: optimization techniques for federated query processing on linked data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
A provenance-aware Linked Data application for trip management and organization
Proceedings of the 7th International Conference on Semantic Systems
ADERIS: an adaptive query processor for joining federated SPARQL endpoints
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
A Cloud-based Dynamic Workflow for Mass Spectrometry Data Analysis
ESCIENCE '11 Proceedings of the 2011 IEEE Seventh International Conference on eScience
Hi-index | 0.00 |
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.