31 search results - page 1 / 7 » Efficient indexing algorithms for one-dimensional discretely... |
IPL
2010
13 years 3 months ago
2010
PVLDB
2010
12 years 11 months ago
2010
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
DEBU
2010
13 years 5 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...