Effective Ontology Matching in High-Performance Computing Environments
Effective Ontology Matching in High-Performance Computing Environments
Extending complex information structures by means of ontology matching is of high interest for a number of tasks solved in the semantic web. The main motivation behind this work is that the procedure of ontology matching requires a robust and scalable solution that ensures the maximal efficiency of matching operations. That is especially important when thinking of matching large scale data among several ontologies, where the performance and scalability of performing the matching algorithms is settled to the point. In this paper, we propose an approach for distributed ontology matching, improving the matching’s efficiency and scalability due to the distribution and parallelization of implemented algorithms. This enables applications performing ontology matching to get benefit of running in high-performance computing environments and ensures that the full potential of computing resources is enabled for the matching process.
Tenschert, Axel
54f0eddb-18da-48bd-8512-034ac7d76e71
Cheptsov, Alexey
3aa56ba2-3ee2-4695-a18c-d81338790c02
30 September 2009
Tenschert, Axel
54f0eddb-18da-48bd-8512-034ac7d76e71
Cheptsov, Alexey
3aa56ba2-3ee2-4695-a18c-d81338790c02
Tenschert, Axel and Cheptsov, Alexey
(2009)
Effective Ontology Matching in High-Performance Computing Environments.
1st International Workshop on Semantic Web Applications for Learning and Teaching Support in Higher Education (SemHE'09), ECTEL'09, Nice, France.
Record type:
Conference or Workshop Item
(Poster)
Abstract
Extending complex information structures by means of ontology matching is of high interest for a number of tasks solved in the semantic web. The main motivation behind this work is that the procedure of ontology matching requires a robust and scalable solution that ensures the maximal efficiency of matching operations. That is especially important when thinking of matching large scale data among several ontologies, where the performance and scalability of performing the matching algorithms is settled to the point. In this paper, we propose an approach for distributed ontology matching, improving the matching’s efficiency and scalability due to the distribution and parallelization of implemented algorithms. This enables applications performing ontology matching to get benefit of running in high-performance computing environments and ensures that the full potential of computing resources is enabled for the matching process.
Text
semhe09_submission_6.pdf
- Other
More information
Published date: 30 September 2009
Additional Information:
Event Dates: 30 September 2009
Venue - Dates:
1st International Workshop on Semantic Web Applications for Learning and Teaching Support in Higher Education (SemHE'09), ECTEL'09, Nice, France, 2009-09-30
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 268056
URI: http://eprints.soton.ac.uk/id/eprint/268056
PURE UUID: 9c844f4e-32f7-457f-b57b-ec81d8c6f38c
Catalogue record
Date deposited: 14 Oct 2009 15:13
Last modified: 14 Mar 2024 09:03
Export record
Contributors
Author:
Axel Tenschert
Author:
Alexey Cheptsov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics