A Map-Reduce Algorithm for Querying Linked Data Based on Query Decomposition into Stars

Provided by: Creative Commons
Topic: Data Management
Format: PDF
In this paper, the authors investigate the problem of efficient querying large amount of linked data using Map-Reduce framework. They assume data graphs that are arbitrarily partitioned in the distributed file system. Their 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. They propose a two-phase, scalable Map-Reduce algorithm that efficiently results the answer of the initial query by computing and appropriately combining the subquery answers.

Find By Topic