1675 search results - page 8 / 335 » Implementing Data Cubes Efficiently |
TC
2008
13 years 9 months ago
2008
Abstract-- A radix-2 digit-recurrence algorithm and architecture for the computation of the cube root are presented in this paper. The original recurrence based on the concept of c...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
EDBT
2000
ACM
14 years 1 months ago
2000
ACM
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
KDD
1999
ACM
14 years 2 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data value...