Efficient distributed query processing for autonomous RDF databases

  • Prasser F
  • Kemper A
  • Kuhn K
  • 29


    Mendeley users who have this article in their library.
  • 14


    Citations of this article.


The inherent flexibility of the RDF data model has led to its notable adoption in many domains, especially in the area of life-sciences. Some of these domains have an emerging need to access data integrated from various distributed sources of information. It is not always possible to implement this by simply loading all data into one central RDF store. For example, in the context of inter-institutional collaboration for drug development and clinical research participants of- ten want to maintain control over their local databases. Al- ternatively, distributed query processing techniques can be utilized to evaluate queries by accessing the remote data sources only on demand and in conformance with local au- thorization models. In this paper we present an efficient ap- proach to distributed query processing for large autonomous RDF databases. The groundwork is laid by a comprehen- sive RDF-specific schema- and instance-level synopsis. We present an optimizer that is able to utilize this synopsis to generate compact execution plans by precisely determining, at compile-time, those sources that are relevant to a query. Furthermore we present a tightly integrated query engine that is able to further reduce the volume of intermediate re- sults at run-time. An extensive evaluation shows that our approach improves query execution times by up to two and transferred data volumes by up to three orders of magnitude compared to a na¨ıve implementation.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Fabian Prasser

  • Alfons Kemper

  • Klaus A. Kuhn

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free