Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many different matching solutions have been proposed so far. In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching. Some innovations are in introducing new criteria which are based on (i) general properties of matching techniques, (ii) interpretation of input information, and (iii) the kind of input information. In particular, we distinguish between approximate and exact techniques at schema-level; and syntactic, semantic, and external techniques at element- and structure-...
Ontology matching can be defined as the process of discovering similarities between two ontologies, ...
Research related schema matching has been conducted since last decade. Few approach related schema m...
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies)...
shvaiko2005aInternational audienceSchema and ontology matching is a critical problem in many applica...
Schema/ontology matching is a critical problem in many application domains, such as, Semantic Web, s...
An ontology typically provides a vocabulary that describes a domain of interest and a specification ...
Ontology matching is an important task when data from multiple data sources is integrated. Problems ...
Schema matching is the process of developing semantic matches between two or more schemas. The purpo...
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a...
Schema matching is a critical step in many applications, such as data warehouse loading, Online Anal...
Schema matching is a basic problem in many database application domains, such as data integration, E...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schema...
Ontology matching is a critical operation in many well-known metadata intensive applications, such a...
This evaluation of the state-of-the-art schema matching approaches is based on a comprehensive testi...
shvaiko2013aInternational audienceAfter years of research on ontology matching, it is reasonable to ...
Ontology matching can be defined as the process of discovering similarities between two ontologies, ...
Research related schema matching has been conducted since last decade. Few approach related schema m...
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies)...
shvaiko2005aInternational audienceSchema and ontology matching is a critical problem in many applica...
Schema/ontology matching is a critical problem in many application domains, such as, Semantic Web, s...
An ontology typically provides a vocabulary that describes a domain of interest and a specification ...
Ontology matching is an important task when data from multiple data sources is integrated. Problems ...
Schema matching is the process of developing semantic matches between two or more schemas. The purpo...
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a...
Schema matching is a critical step in many applications, such as data warehouse loading, Online Anal...
Schema matching is a basic problem in many database application domains, such as data integration, E...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schema...
Ontology matching is a critical operation in many well-known metadata intensive applications, such a...
This evaluation of the state-of-the-art schema matching approaches is based on a comprehensive testi...
shvaiko2013aInternational audienceAfter years of research on ontology matching, it is reasonable to ...
Ontology matching can be defined as the process of discovering similarities between two ontologies, ...
Research related schema matching has been conducted since last decade. Few approach related schema m...
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies)...