Affiliation:
1. University of Michigan, Ann Arbor, Michigan
Abstract
An increasing number of database applications today require sophisticated approximate string matching capabilities. Examples of such application areas include data integration and data cleaning. Cosine similarity has proven to be a robust metric for scoring the similarity between two strings, and it is increasingly being used in complex queries. An immediate challenge faced by current database optimizers is to find accurate and efficient methods for estimating the selectivity of cosine similarity predicates. To the best of our knowledge, there are no known methods for this problem. In this paper, we present the first approach for estimating the selectivity of tf.idf based cosine similarity predicates. We evaluate our approach on three different real datasets and show that our method often produces estimates that are within 40% of the actual selectivity.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference10 articles.
1. Digital Bibliography and Library Project (DBLP) http://dblp.uni-trier.de/. Digital Bibliography and Library Project (DBLP) http://dblp.uni-trier.de/.
2. Using q-grams in a DBMS for approximate string processing;Gravano L.;IEEE Data Engineering Bulletin,2001
3. Text joins for data cleansing and integration in an RDBMS
4. Text joins in an RDBMS for web data integration
Cited by
111 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献