Files in this item



application/pdfLee_Yoonkyong.pdf (3MB)
(no description provided)PDF


Title:Developing, Tuning, and Using Schema Matching Systems
Author(s):Lee, Yoonkyong
Contributor(s):Doan, AnHai
Subject(s):data integration
schema matching
Abstract:This dissertation studies the schema matching problem that finds semantic correspondences (called matches) between disparate data sources. Examples of semantic matches include “location = address” and “name = concat(first-name,last-name).” Schema matching is one of the key challenges for many data sharing and exchange applications. Prime examples of such applications arise in numerous contexts, including data warehousing, scientific collaboration, e-commerce, bioinformatics, and data integration on the World Wide Web. Despite significant progress, many challenges remain. These include discovering complex matches, a prevalent problem in practice, tuning a matching system, and deploying a matching system effectively in an application. In this dissertation, we develop solutions for the three challenges mentioned above. First, we develop a system that discovers both one-to-one and complex matches and provides a novel explanation facility that helps users analyze matches. Next, we develop a framework that automatically tunes multi-component matching systems by synthesizing a collection of matching scenarios. Finally, we show that we can efficiently exploit discovered semantic matches without extra user effort in certain applications.
Issue Date:2010
Genre:Dissertation / Thesis
Date Available in IDEALS:2010-04-01

This item appears in the following Collection(s)

Item Statistics