489 search results - page 39 / 98 » Query Selectivity Estimation via Data Mining |
100
click to vote
IDEAS
2008
IEEE
15 years 6 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 ...
IPL
2006
14 years 11 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
WWW
2002
ACM
16 years 14 days ago
2002
ACM
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...