Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Semantic Schema Matching
verfasst von : Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskevich
Erschienen in: On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
(concepts, not labels) which is codified in the elements and the structures of schemas. In this paper we present basic and optimized algorithms for semantic schema matching, and we discuss their implementation within the S-Match system. We also validate the approach and evaluate S-Match against three state of the art matching systems. The results look promising, in particular for what concerns quality and performance.