首页> 外文会议>International Semantic Web Conference >Large Scale Fuzzy pD~* Reasoning Using MapReduce
【24h】

Large Scale Fuzzy pD~* Reasoning Using MapReduce

机译:大规模模糊PD〜*使用MapReduce推理

获取原文

摘要

The MapReduce framework has proved to be very efficient for data-intensive tasks. Earlier work has tried to use MapReduce for large scale reasoning for pD~* semantics and has shown promising results. In this paper, we move a step forward to consider scalable reasoning on top of semantic data under fuzzy pD~* semantics (i.e., an extension of OWL pD~* semantics with fuzzy vagueness). To the best of our knowledge, this is the first work to investigate how MapReduce can help to solve the scalability issue of fuzzy OWL reasoning. While most of the optimizations used by the existing MapReduce framework for pD~* semantics are also applicable for fuzzy pD~* semantics, unique challenges arise when we handle the fuzzy information. We identify these key challenges, and propose a solution for tackling each of them. Furthermore, we implement a prototype system for the evaluation purpose. The experimental results show that the running time of our system is comparable with that of WebPIE, the state-of-the-art inference engine for scalable reasoning in pD~* semantics.
机译:MapReduce框架已被证明对数据密集型任务非常有效。早期的工作试图使用MapReduce进行大规模推理PD〜*语义,并显示出现有前途的结果。在本文中,我们向前看的一步是在模糊PD〜*语义下的语义数据上考虑可扩展的推理(即,猫头鹰PD〜*语义的延伸,具有模糊模糊的语义)。据我们所知,这是第一个调查Mabreduce如何帮助解决模糊猫头鹰推理的可扩展性问题的工作。虽然现有MapReduce框架用于PD〜*语义使用的大多数优化也适用于模糊PD〜*语义,但在处理模糊信息时出现独特的挑战。我们确定这些关键挑战,并提出解决它们中的每一个解决方案。此外,我们为评估目的实施原型系统。实验结果表明,我们的系统的运行时间与WebPie的运行时间相当,最先进的推理引擎,用于PD〜*语义中的可扩展推理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号