Semantic Schema Matching Using DBpedia

In semantic computing, Match is an operator that takes as an input two graph-like structures; it can be database schemas or XML schemas and generates a mapping between the corresponding nodes of the two graphs. In semantic schema matching, we attempt to explore the mappings between the two schemas; based on their semantics by employing any semantic similarity measure. In this study, we have defined taxonomy of all possible semantic similarity measures; moreover we also proposed an approach that exploits semantic relations stored in the DBpedia dataset while utilizing a hybrid ranking system to dig out the similarity between nodes of the two graphs.