Sciweavers

354 search results - page 5 / 71
» Approximate String Joins
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 7 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
ICDE
2006
IEEE
161views Database» more  ICDE 2006»
14 years 9 months ago
A Primitive Operator for Similarity Joins in Data Cleaning
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...
Surajit Chaudhuri, Venkatesh Ganti, Raghav Kaushik
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
GEOINFO
2007
13 years 9 months ago
Approximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
Clodoveu A. Davis, Emerson de Salles