Semantic Schema Matching

Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2005) Semantic Schema Matching. UNSPECIFIED. (In Press)

Download (821Kb) | Preview


    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 the quality and performance indicators.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Additional Information: To appear in proceedings of the 13th International Conference on Cooperative Information Systems (CoopIS 2005)
    Report Number: DIT-05-014
    Repository staff approval on: 27 Oct 2005

    Actions (login required)

    View Item