Scalable Distributed Reasoning Using MapReduce
Scalable Distributed Reasoning Using MapReduce
复制标题
DOI：
10.1007/978-3-642-04930-9_40
复制
发表时间：
2009-11
期刊：
影响因子：
--
通讯作者：
Jacopo Urbani;S. Kotoulas;E. Oren;F. V. Harmelen
中科院分区：
文献类型：
--
作者：
Jacopo Urbani;S. Kotoulas;E. Oren;F. V. Harmelen
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 commodity machines. We show that a naive implementation on top of MapReduce is straightforward but performs badly and we present several non-trivial optimisations. Our algorithm is scalable and allows us to compute the RDFS closure of 865M triples from the Web (producing 30B triples) in less than two hours, faster than any other published approach.
