Please use this identifier to cite or link to this item: http://hdl.handle.net/2307/4306
Title: Advanced techniques for mapping and cleaning
Authors: Santoro, Donatello
Advisor: Mecca, Giansalvatore
Keywords: data cleaning
data repairing
data quality
contraints chase
schema mapping
Issue Date: 9-Jun-2014
Publisher: Università degli studi Roma Tre
Abstract: We address the challenging and open problem of bringing together two crucial activities in data integration and data quality, i.e., transforming data using schema mappings, and fixing conflicts and inconsistencies using data repairing. This problem is made complex by several factors. First, schema mappings and data repairing have traditionally been considered as separate activities, and research has progressed in a largely independent way in the two fields. Second, the elegant formalizations and the algorithms that have been proposed for both tasks have had mixed fortune in scaling to large databases. In the thesis, we introduce a very general notion of a mapping and cleaning scenario that incorporates a wide variety of features, like, for example, user interventions. We develop a new semantics for these scenarios that represents a conservative extension of previous semantics for schema mappings and data repairing. Based on the semantics, we introduce a chase-based algorithm to compute solutions. Appropriate care is devoted to developing a scalable implementation of the chase algorithm. To the best of our knowledge, this is the first general and scalable proposal in this direction.
URI: http://hdl.handle.net/2307/4306
Access Rights: info:eu-repo/semantics/openAccess
Appears in Collections:X_Dipartimento di Ingegneria
T - Tesi di dottorato

Files in This Item:
File Description SizeFormat
Santoro - Advanced Techniques for Mapping and Cleaning.pdf2.56 MBAdobe PDFView/Open
Show full item record Recommend this item

Page view(s)

76
Last Week
0
Last month
0
checked on Apr 19, 2024

Download(s)

19
checked on Apr 19, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.