Benchmarking declarative approximate selection predicates.
Published: 2007
Language: eng
Number of pages: 70
ISBN-13: 9780494272879
Description: Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize data quality primitives on top of any relational data source. A primary advantage of such an approach is the ease of use and integration with existing applications.Over the last couple of years several similarity predicates have been proposed for common quality primitives (approximate selections, joins, etc.) and have been fully expressed using declarative SQL staterrrents. In this thesis, new similarity predicates are proposed along with their declarative realization, based on notions of probabilistic information retrieval. Then, full declarative specifications of previously proposed similarity predicates in the literature are presented, grouped into classes according to their primary characteristics. Finally, a thorough performance and accuracy study comparing a large number of similarity predicates for data cleaning operations is performed.
Notes: Source: Masters Abstracts International, Volume: 45-06, page: 3187.

Advisor: Nick Koudas.

Thesis (M.Sc.)--University of Toronto, 2007.

Electronic version licensed for access by U. of T. users.

ROBARTS MICROTEXT copy on microfiche.