DMCA
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints (2008)
Cached
Download Links
| Citations: | 72 - 8 self |
BibTeX
@MISC{Xiao08ed-join:an,
author = {Cuan Xiao and Wei Wang and Xuemin Lin},
title = { Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data integration and cleaning, bioinformatics, and pattern recognition. We focus on efficient algorithms for similarity join with edit distance constraints. Existing approaches are mainly based on converting the edit distance constraint to a weaker constraint on the number of matching q-grams between pair of strings. In this paper, we propose the novel perspective of investigating mismatching q-grams. Technically, we derive two new edit distance lower bounds by analyzing the locations and contents of mismatching q-grams. A new algorithm, Ed-Join, is proposed that exploits the new mismatch-based filtering methods; it achieves substantial reduction of the candidate sizes and hence saves computation time. We demonstrate experimentally that the new algorithm outperforms alternative methods on large-scale real datasets under a wide range of parameter settings.
Keyphrases
similarity join edit distance constraint efficient algorithm parameter setting new algorithm new algorithm outperforms candidate size new mismatch-based filtering method fundamental operation large-scale real datasets new edit distance research community considerable interest many application area wide range substantial reduction pattern recognition novel perspective data integration hence save computation time
