Benchmarking Declarative Approximate Selection Predicates

Details Benchmarking Declarative Approximate Selection Predicates Benchmarking Declarative Approximate Selection Predicates

2009-07-15

arxiv.org/abs/0907.2471v1

Computer Science

Databases

75 pages, 7 figures, February 2007, Masters Thesis at University of Toronto

Scientific paper

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. Several similarity predicates have been proposed in the past for common quality primitives (approximate selections, joins, etc.) and have been fully expressed using declarative SQL statements. 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.

Affiliated with

Also associated with

No associations

Rating

Benchmarking Declarative Approximate Selection Predicates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Benchmarking Declarative Approximate Selection Predicates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Benchmarking Declarative Approximate Selection Predicates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363848