|
|
|
     |
                                     |
Return to Similarity Queries I
To ensure high data quality, data warehouses must validate and cleanse incoming data tuples from external sources. In many situations, clean tuples must match acceptable tuples in reference tables. For example, product name and description fields in a sales record from a distributor must match the pre-recorded name and description fields in a product reference relation. A significant challenge in such a scenario is to implement an efficient and accurate fuzzy match operation that can effectively clean an incoming tuple if it fails to match exactly with any tuple in the reference relation. In this paper, we propose a new similarity function which overcomes limitations of commonly used similarity functions, and develop an efficient fuzzy match algorithm. We demonstrate the effectiveness of our techniques by evaluating them on real datasets.
@inproceedings {DBLP:conf/sigmod/ChaudhuriGGM03, author = {Surajit Chaudhuri and Kris Ganjam and Venkatesh Ganti and Rajeev Motwani}, booktitle = {SIGMOD Conference}, title = {Robust and Efficient Fuzzy Match for Online Data Cleaning.}, pages = {313-324}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#ChaudhuriGGM03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r12p02.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
