2013 · 66 citations · 25 references
ComputingBioinformaticsComputational BiologyGenomic Data AnalysisInformation RetrievalNearest Neighbor SearchRange SearchingString AlgorithmsText Similarity AnalysisDistance ConstraintsEdit DistanceSequence SimilaritySimilarity SearchSimilarity SearchingString Search
String similarity search is a fundamental operation in many areas, such as data cleaning, information retrieval, and bioinformatics. In this paper we study the problem of top-k string similarity search with edit-distance constraints, which, given a collection of strings and a query string, returns the top-k strings with the smallest edit distances to the query string. Existing methods usually try different edit-distance thresholds and select an appropriate threshold to find top-k answers. However it is rather expensive to select an appropriate threshold. To address this problem, we propose a progressive framework by improving the traditional dynamic-programming algorithm to compute edit distance. We prune unnecessary entries in the dynamic-programming matrix and only compute those pivotal entries. We extend our techniques to support top-k similarity search. We develop a range-based method by grouping the pivotal entries to avoid duplicated computations. Experimental results show that our method achieves high performance, and significantly outperforms state-of-the-art approaches on real-world datasets.
25
Scaling up all pairs similarity search
Roberto J. Bayardo, Yiming Ma, Ramakrishnan Srikant · 2007 · 677 citations
Approximate String Joins in a Database (Almost) for Free
Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish et al. · 2001 · 510 citations
Efficient exact set-similarity joins
Arvind Arasu, Raghav Kaushik · 2006 · 405 citations