2034 search results - page 1 / 407 » Substring Selectivity Estimation |
PODS
2000
ACM
13 years 9 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
EDBT
2009
ACM
14 years 7 days ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
PODS
1999
ACM
13 years 9 months ago
1999
ACM
TSMC
2008
13 years 5 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
Abstract We propose in this paper a novel approach to the classification of discrete sequences. This approach builds a model fitting some dynamical features deduced from the learni...