354 search results - page 6 / 71 » Approximate String Joins |
DASFAA
2009
IEEE
14 years 2 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
VLDB
2004
ACM
14 years 29 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
COCOON
2010
Springer
13 years 11 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
ALMOB
2006
13 years 7 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...