Querying Distributed RDF Graphs: The Effects of Partitioning

Download Now
Provided by: RWTH Aachen University
Topic: Data Management
Format: PDF
Web-scale RDF (Resource Description Framework) datasets are increasingly processed using distributed RDF data stores built on top of a cluster of shared-nothing servers. Such systems critically rely on their data partitioning scheme and query answering scheme, the goal of which is to facilitate correct and efficient query processing. Existing data partitioning schemes are commonly based on hashing or graph partitioning techniques. The latter techniques split a dataset in a way that minimizes the number of connections between the resulting subsets, thus reducing the need for communication between servers; however, to facilitate efficient query answering, considerable duplication of data at the intersection between subsets is often needed.
Download Now

Find By Topic