Semantic Matching: Algorithms and Implementation

Giunchiglia, Fausto and Yatskevich, Mikalai and Shvaiko, Pavel (2007) Semantic Matching: Algorithms and Implementation. UNSPECIFIED.

Download (1335Kb) | Preview


    We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on 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 matching, and we discuss their implementation within the S-Match system. We evaluate S-Match against three state of the art matching systems, thereby justifying empirically the strength of our approach.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Additional Information: In the Journal on Data Semantics (JoDS), 2007
    Report Number: DIT-07-001
    Repository staff approval on: 20 Feb 2007

    Actions (login required)

    View Item