Institute for Web Science and Technologies · Universität Koblenz - Landau

Graph Partitioning Approaches for Distributed RDF Stores

[go to overview]
Daniel Janke

There is an increasing availability of data encoded in the W3C standard Resource Description framework (RDF). In a near future, this may pose severe problem to classical approaches for query answering based on a single computing node. A natural approach to tackle this challenge is to resort to distributed RDF stores that combine several computing nodes in one virtual system. In general, distributed RDF stores splits an RDF graph into several partitions that are assigned to computing nodes. Hence, the partitioning strategy influences the efficiency of query execution. This is true as the computation of one single result can require triples stored on several different computing nodes. In this talk I will give an overview of different graph partitioning approaches used in existing distributed RDF stores.

11.12.14 - 10:15
B 016