A Map-Reduce algorithm for querying linked data based on query decomposition into stars.

In this paper, we investigate the problem of ecient query- ing large amount of linked data using Map-Reduce frame- work. We assume data graphs that are arbitrarily parti- tioned in the distributed file system. Our technique focuses on the decomposition of the query posed by the user, which is given in the form of a query graph into star subqueries. We propose a two-phase, scalable Map-Reduce algorithm that eciently results the answer of the initial query by comput- ing and appropriately combining the subquery answers.