475 search results - page 3 / 95 » Efficient Set Similarity Joins Using Min-prefixes |
ISCC
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
TKDE
2002
13 years 5 months ago
2002
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the do...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
WWW
2004
ACM
14 years 6 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...