IEEE Trans Cybern. 2015 Jan;45(1):53-64. doi: 10.1109/TCYB.2014.2318898. Epub 2014 May 7.
With the upcoming data deluge of semantic data, the fast growth of ontology bases has brought significant challenges in performing efficient and scalable reasoning. Traditional centralized reasoning methods are not sufficient to process large ontologies. Distributed reasoning methods are thus required to improve the scalability and performance of inferences. This paper proposes an incremental and distributed inference method for large-scale ontologies by using MapReduce, which realizes high-performance reasoning and runtime searching, especially for incremental knowledge base. By constructing transfer inference forest and effective assertional triples, the storage is largely reduced and the reasoning process is simplified and accelerated. Finally, a prototype system is implemented on a Hadoop framework and the experimental results validate the usability and effectiveness of the proposed approach.
随着语义数据的即将到来的数据洪流,本体库的快速增长给高效且可扩展的推理带来了重大挑战。传统的集中式推理方法不足以处理大型本体。因此,需要分布式推理方法来提高推理的可扩展性和性能。本文提出了一种基于 MapReduce 的大规模本体增量式和分布式推理方法,实现了高性能推理和运行时搜索,尤其是对于增量知识库。通过构建传递推理森林和有效的断言三元组,大大减少了存储,简化和加速了推理过程。最后,在 Hadoop 框架上实现了一个原型系统,实验结果验证了所提出方法的可用性和有效性。