|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 34 - Issue 8 |
| Published: November 2011 |
| Authors: K. Saruladha, Dr. G. Aghila, B. Sathiya |
10.5120/4118-5981
|
K. Saruladha, Dr. G. Aghila, B. Sathiya . A Comparative Analysis of Ontology and Schema Matching Systems. International Journal of Computer Applications. 34, 8 (November 2011), 14-21. DOI=10.5120/4118-5981
@article{ 10.5120/4118-5981,
author = { K. Saruladha,Dr. G. Aghila,B. Sathiya },
title = { A Comparative Analysis of Ontology and Schema Matching Systems },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 34 },
number = { 8 },
pages = { 14-21 },
doi = { 10.5120/4118-5981 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A K. Saruladha
%A Dr. G. Aghila
%A B. Sathiya
%T A Comparative Analysis of Ontology and Schema Matching Systems%T
%J International Journal of Computer Applications
%V 34
%N 8
%P 14-21
%R 10.5120/4118-5981
%I Foundation of Computer Science (FCS), NY, USA
In a distributed and open system, such as the semantic web and many other applications like information integration, peer- peer communication, etc., the heterogeneity among the data increases enormously. To solve the heterogeneity issue various matching techniques are proposed and large-scale matching needs especially to be supported for different kinds of ontologies and XML schemas due to their increasing use and size, e.g., in life science applications, e-business and web. In this paper the techniques which are scalable like early pruning, partitioning, parallelization and some renowned scalable matching techniques are discussed. In addition to it, a brief comparison of the discussed matching techniques is also presented.