An Improved Semantic Schema Matching Approach
Authors
Abstract:
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new improved solution for schema matching problem. An improvement hybrid semantic schema matching algorithm which semi automatically finds matching between two data representation schemas is introduced. The algorithm finds mappings based on the hierarchical organization of the elements of a term WordNet dictionary.
similar resources
an improved semantic schema matching approach
schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...
full textSemantic Schema Matching
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic schema matching is based on the two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (con...
full textIterative Schema-based Semantic Matching
An ontology typically provides a vocabulary that describes a domain of interest and a specification of the meaning of terms used in the vocabulary. Depending on the precision of this specification, the notion of ontology encompasses several data and conceptual models, for example, classifications, database schemas, fully axiomatized theories. Ontologies tend to be put everywhere. They are viewe...
full textSemantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartit...
full textSchema Matching and Schema Merging based on Uncertain Semantic Mappings
This dissertation lies in the research area of schema integration: the problem of combining the data of different data sources by creating a unified representation of these data. Two core issues in schema integration are schema matching, i.e. the identification of correspondences, or mappings, between input schema objects, and schema merging, i.e. the creation of a unified schema based on the i...
full textEnhanced geographically typed semantic schema matching
Resolving semantic heterogeneity across distinct data sources remains a highly relevant problem in the GIS domain requiring innovative solutions. Our approach, called GSim, semantically aligns tables from respective GIS databases by first choosing attributes for comparison. We then examine their instances and calculate a similarity value between them called entropy-based distribution (EBD) by c...
full textMy Resources
Journal title
volume 1 issue 1
pages 29- 36
publication date 2015-02-15
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023