arrow
返回

Performance-based ontology matching

delete2015-03-08
delete8
PRE
AI
M
Muhammad Bilal Amin
W
Wajahat Ali Khan
S
Sungyoung Lee *
B
Byeong Ho Kang
DOI:10.1007/s10489-015-0648-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Ontology matching is among the core techniques used for heterogeneity resolution by information and knowledge-based systems. However, due to the excess and ever-evolving nature of data, ontologies are becoming large-scale and complex; consequently, leading to performance bottlenecks during ontology matching. In this paper, we present our performance-based ontology matching system. Today's desktop and cloud platforms are equipped with parallelism-enabled multicore processors. Our system benefits from this opportunity and provides effectiveness-independent data parallel ontology matching resolution over parallelism-enabled platforms. Our system decomposes complex ontologies into smaller, simpler, and scalable subsets depending upon the needs of matching algorithms. Matching process over these subsets is divided from granular to finer-level abstraction of independent matching requests, matching jobs, and matching tasks, running in parallel over parallelism-enabled platforms. Execution of matching algorithms is aligned for the minimization of the matching space during the matching process. We comprehensively evaluated our system over OAEI's dataset of fourteen real world ontologies from diverse domains, having different sizes and complexities. We have executed twenty different matching tasks over parallelism-enabled desktop and Microsoft Azure public cloud platform. In a single-node desktop environment, our system provides an impressive performance speedup of 4.1, 5.0, and 4.9 times for medium, large, and very large-scale ontologies. In a single-node cloud environment, our system provides an impressive performance speedup of 5.9, 7.4, and 7.0 times for medium, large, and very large-scale ontologies. In a multi-node (3 nodes) environment, our system provides an impressive performance speedup of 15.16 and 21.51 times over desktop and cloud platforms respectively.
Keyword:
Ontology matching
Heterogeneity resolution
Multithreading
Parallel processing
Parallel programming
Semantic web
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Intelligence 封面图
Applied Intelligence
IF:
3.5
论文数:
7.6K
被引数:
1.7W

机构

U
University of Tasmania
学者数:
1.3W
论文数: 1.3W
被引数: 1.8W
K
kyung hee university
学者数:
2.3W
论文数: 2.2W
被引数: 234
引用论文

引用论文

Large-scale biomedical ontology matching with ServOMap
errIRBM
IF4.2
err2013-02-01
err17
PREAI
errBa, M.; Diallo, G.
err分享
err收藏
err分享
err收藏
The adult mouse anatomical dictionary: a tool for annotating and integrating data
err2005-02-15
err140
errOAAI
errHayamizu, TF; Mangan, M; Corradi, JP; Kadin, JA; Ringwald, M
err分享
err收藏
err分享
err收藏
The Gene Ontology (GO) database and informatics resource基因本体论 (GO) 数据库和信息学资源
err2004-01-01
err3.3K
errOAAI
errHarris, MA; Clark, J; Ireland, A; Lomax, J; Ashburner, M; Foulger, R; Eilbeck, K; Lewis, S; Marshall, B; Mungall, C; Richter, J; Rubin, GM; Blake, JA; Bult, C; Dolan, M; Drabkin, H; Eppig, JT; Hill, DP; Ni, L; Ringwald, M; Balakrishnan, R; Cherry, JM; Christie, KR; Costanzo, MC; Dwight, SS; Engel, S; Fisk, DG; Hirschman, JE; Hong, EL; Nash, RS; Sethuraman, A; Theesfeld, CL; Botstein, D; Dolinski, K; Feierbach, B; Berardini, T; Mundodi, S; Rhee, SY; Apweiler, R; Barrell, D; Camon, E; Dimmer, E; Lee, V; Chisholm, R; Gaudet, P; Kibbe, W; Kishore, R; Schwarz, EM; Sternberg, P; Gwinn, M; Hannick, L; Wortman, J; Berriman, M; Wood, V; de la Cruz, N; Tonellato, P; Jaiswal, P; Seigfried, T; White, R
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容