49 search results - page 3 / 10 » Sampling-Based Estimation of the Number of Distinct Values o... |
DEXA
2005
Springer
14 years 28 days ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
ADBIS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between objects to select the most ...
ICMLA
2003
13 years 8 months ago
2003
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
DATAMINE
1999
13 years 7 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...