20 search results - page 2 / 4 » Approximate Query Processing on High Dimensionality Database... |
ICDE
2003
IEEE
14 years 7 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
VLDB
2005
ACM
14 years 6 months ago
2005
ACM
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
SIGMOD
1999
ACM
13 years 10 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
MICAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...