12 search results - page 1 / 3 » Providing probabilistically-bounded approximate answers to n... |
DOLAP
2005
ACM
13 years 6 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
SIGMOD
1999
ACM
13 years 9 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...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...