Finding Set-Mappings in Schema Matching

Speaker: Eric LO

Abstract

Automating schema matching is challenging. Previous approaches to automating schema matching focus on computing direct element matches between two schemas. Schemas, however, rarely match directly. Thus, to complete the task of schema matching, we must also find a set of matched elements.

In this talk, I will present the current approaches on schema matching and their limitations. One possible approach to tackle the current limitations is to find both intra-schema similarities and inter-schema similarities. Some other possible directions and approaches will also be discussed.

Referred Papers