2034 search results - page 3 / 407 » Substring Selectivity Estimation |
IDEAS
2008
IEEE
14 years 1 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a nov...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
ISMB
1998
13 years 8 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...