首页> 外文期刊>Knowledge-Based Systems >A fine-grained load balancing technique for improving partition-parallel-based ontology matching approaches
【24h】

A fine-grained load balancing technique for improving partition-parallel-based ontology matching approaches

机译:一种用于改进基于分区并行的本体匹配方法的细粒度负载平衡技术

获取原文
获取原文并翻译 | 示例
           

摘要

Currently, the use of large ontologies in various areas of knowledge is increasing. Since these ontologies can present overlapping of content, the identification of correspondences between entities becomes necessary for different tasks, for example, data integration and data linkage. Matching large ontologies is a challenge since it involves an excessive number of comparisons between entities which leads to high execution times and requires a considerable amount of computing resources. This work proposes a fine-grained load balancing technique which can be applied to Partition-Parallel-based Ontology Matching (PPOM) approaches. A PPOM approach partitions the input ontologies into sub-ontologies and executes the comparisons between entities in parallel (for instance, using MapReduce). In this sense, the fine-grained load balancing technique aims to guide the even distribution of comparisons among the nodes of a cluster infrastructure. Experimental results indicate that the proposed load balancing technique is able to reduce the overall execution time of PPOM approaches. (C) 2016 Elsevier B.V. All rights reserved.
机译:当前,在各种知识领域中大型本体的使用正在增加。由于这些本体可以呈现内容的重叠,因此实体之间的对应关系的标识对于不同的任务(例如,数据集成和数据链接)变得必要。匹配大型本体是一个挑战,因为它涉及实体之间过多的比较,这导致执行时间较长,并且需要大量的计算资源。这项工作提出了一种细粒度的负载平衡技术,该技术可以应用于基于分区并行的本体匹配(PPOM)方法。 PPOM方法将输入本体划分为子本体,并并行执行实体之间的比较(例如,使用MapReduce)。从这个意义上讲,细粒度的负载平衡技术旨在指导集群基础结构节点之间比较的平均分布。实验结果表明,所提出的负载均衡技术能够减少PPOM方法的总体执行时间。 (C)2016 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号