Querying Distributed RDF Data Sources with SPARQL
Querying Distributed RDF Data Sources with SPARQL | |
---|---|
Querying Distributed RDF Data Sources with SPARQL
| |
Bibliographical Metadata | |
Subject: | Querying Distributed RDF Data Sources |
Year: | 2008 |
Authors: | Bastian Quilitz, Ulf Leser |
Venue | ESWC |
Content Metadata | |
Implementation: | DARQ |
Contents
Abstract
DARQ provides transparent query access to multiple SPARQL services, i.e., it gives the user the impression to query one single RDF graph despite the real data being distributed on the web. A service description language enables the query engine to decompose a query into sub-queries, each of which can be answered by an individual service. DARQ also uses query rewriting and cost-based query optimization to speed-up query execution.
Conclusion
DARQ offers a single interface for querying multiple, distributed SPARQL end-points and makes query federation transparent to the client. One key feature of DARQ is that it solely relies on the SPARQL standard and therefore is compatible to any SPARQL endpoint implementing this standard. Using service descriptions provides a powerful way to dynamically add and remove endpoints to the query engine in a manner that is completely transparent to the user. To reduce execution costs we introduced basic query optimization for SPARQL queries. Our experiments show that the optimization algorithm can drastically improve query performance and allow distributed answering of SPARQL queries over distributed sources in reasonable time. Because the algorithm only relies on a very small amount of statistical information we expect that further improvements are possible using techniques. An important issue when dealing with data from multiple data sources are differences in the used vocabularies and the representation of information. In further work, we plan to work on mapping and translation rules between the vocabularies used by different SPARQL endpoints. Also, we will investigate generalizing the query patterns that can be handled and blank nodes and identity relationships across graphs.
Future work
In further work, we plan to work on mapping and translation rules between the vocabularies used by different SPARQL endpoints. Also, we will investigate generalizing the query patterns that can be handled and blank nodes and identity relationships across graphs.
Approach
Positive Aspects: {{{PositiveAspects}}}
Negative Aspects: {{{NegativeAspects}}}
Limitations: {{{Limitations}}}
Challenges: {{{Challenges}}}
Proposes Algorithm: {{{ProposesAlgorithm}}}
Methodology: {{{Methodology}}}
Requirements: {{{Requirements}}}
Limitations: {{{Limitations}}}
Implementations
Download-page: {{{Download-page}}}
Access API: {{{API}}}
Information Representation: {{{InfoRepresentation}}}
Data Catalogue: {{{Catalogue}}}
Runs on OS: {{{OS}}}
Vendor: {{{vendor}}}
Uses Framework: {{{Framework}}}
Has Documentation URL: {{{DocumentationURL}}}
Programming Language: {{{ProgLang}}}
Version: {{{Version}}}
Platform: {{{Platform}}}
Toolbox: {{{Toolbox}}}
GUI: No
Research Problem
Subproblem of: {{{Subproblem}}}
RelatedProblem: {{{RelatedProblem}}}
Motivation: {{{Motivation}}}
Evaluation
Experiment Setup: {{{ExperimentSetup}}}
Evaluation Method : {{{EvaluationMethod}}}
Hypothesis: {{{Hypothesis}}}
Description: {{{Description}}}
Dimensions: {{{Dimensions}}}
Benchmark used: {{{Benchmark}}}
Results: {{{Results}}}
Access API | {{{API}}} + |
Event in series | ESWC + |
Has Challenges | {{{Challenges}}} + |
Has DataCatalouge | {{{Catalogue}}} + |
Has Description | {{{Description}}} + |
Has Dimensions | {{{Dimensions}}} + |
Has DocumentationURL | http://{{{DocumentationURL}}} + |
Has Downloadpage | http://{{{Download-page}}} + |
Has EvaluationMethod | {{{EvaluationMethod}}} + |
Has ExperimentSetup | {{{ExperimentSetup}}} + |
Has GUI | No + |
Has Hypothesis | {{{Hypothesis}}} + |
Has Implementation | DARQ + |
Has InfoRepresentation | {{{InfoRepresentation}}} + |
Has Limitations | {{{Limitations}}} + |
Has NegativeAspects | {{{NegativeAspects}}} + |
Has PositiveAspects | {{{PositiveAspects}}} + |
Has Requirements | {{{Requirements}}} + |
Has Results | {{{Results}}} + |
Has Version | {{{Version}}} + |
Has abstract | DARQ provides transparent query access to … DARQ provides transparent query access to multiple SPARQL services, i.e., it gives the user the impression to query one single RDF graph despite the real data being distributed on the web. A service description language enables the query engine to decompose a query into sub-queries, each of which can be answered by an individual service. DARQ also uses query rewriting and cost-based query optimization to speed-up query execution. optimization to speed-up query execution. + |
Has authors | Bastian Quilitz + and Ulf Leser + |
Has conclusion | DARQ offers a single interface for queryin … DARQ offers a single interface for querying multiple, distributed SPARQL end-points and makes query federation transparent to the client. One key feature of DARQ is that it solely relies on the SPARQL standard and therefore is compatible to any SPARQL endpoint implementing this standard. Using service descriptions provides a powerful way to dynamically add and remove endpoints to the query engine in a manner that is completely transparent to the user. To reduce execution costs we introduced basic query optimization for SPARQL queries. Our experiments show that the optimization algorithm can drastically improve query performance and allow distributed answering of SPARQL queries over distributed sources in reasonable time. Because the algorithm only relies on a very small amount of statistical information we expect that further improvements are possible using techniques. An important issue when dealing with data from multiple data sources are differences in the used vocabularies and the representation of information. In further work, we plan to work on mapping and translation rules between the vocabularies used by different SPARQL endpoints. Also, we will investigate generalizing the query patterns that can be handled and blank nodes and identity relationships across graphs. and identity relationships across graphs. + |
Has future work | In further work, we plan to work on mappin … In further work, we plan to work on mapping and translation rules between the vocabularies used by different SPARQL endpoints. Also, we will investigate generalizing the query patterns that can be handled and blank nodes and identity relationships across graphs. and identity relationships across graphs. + |
Has motivation | {{{Motivation}}} + |
Has platform | {{{Platform}}} + |
Has subject | Querying Distributed RDF Data Sources + |
Has vendor | {{{vendor}}} + |
Has year | 2008 + |
Proposes Algorithm | {{{ProposesAlgorithm}}} + |
Title | Querying Distributed RDF Data Sources with SPARQL + |
Uses Framework | {{{Framework}}} + |
Uses Methodology | {{{Methodology}}} + |
Uses Toolbox | {{{Toolbox}}} + |