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
Director of Research:Doan, AnHai
Doctoral Committee Chair(s):Doan, AnHai
Doctoral Committee Member(s):Belford, Geneva G.; Winslett, Marianne; Zhai, ChengXiang
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):schema matching
data integration
Abstract:This dissertation studies the schema matching problem that finds semantic correspon- dences (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 integra- tion 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 pro- vides a novel explanation facility that helps users analyze matches. Next, we develop a framework that automatically tunes multi-component matching systems by synthesiz- ing 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-05-19
Rights Information:Copyright 2010 Yoonkyong Lee
Date Available in IDEALS:2010-05-19
Date Deposited:May 2010

This item appears in the following Collection(s)

Item Statistics