Developing, tuning, and using schema matching systems

schema matching;data integration

Lee, Yoonkyong

关键词: schema matching;    data integration;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/16095/Lee_Yoonkyong.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

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.