Authors:
Manakanatas, D; Plexousakis, D
Author:
Manakanatas, D
Plexousakis, D
URL:
http://ceur-ws.org/Vol-238/paper2.pdf
Recently, schema mapping has found considerable interest in both
research and practice. Determining matching components of database or XML
schemas is needed in many applications, e.g. for e-business and data integra-
tion. In this paper a complete generic solution of the schema mapping problem
is presented. A hybrid semantic schema mapping algorithm which semi-
automatically finds mappings between two data representation schemas is in-
troduced. The algorithm finds mappings based on the hierarchical organization
of the elements of a term dictionary (WordNet) and on the reuse of already
identified matchings. There is also a graphical user interface that allows the
user to parameterize the algorithm in an easy and fast way. Special attention
was paid to the collaboration of the algorithm with a matching management
tool. This collaboration, as proved by the evaluation of the algorithm, resulted
in the creation of a generic system for detecting and managing mappings be-
tween schemas of various types and sizes.