An Array-Based Algorithm for Simultaneous Multidimensional Aggregates (1997)
| Venue: | In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data |
| Citations: | 162 - 3 self |
BibTeX
@INPROCEEDINGS{Zhao97anarray-based,
author = {Yihong Zhao and Prasad M. Deshpande and Jeffrey F. Naughton},
title = {An Array-Based Algorithm for Simultaneous Multidimensional Aggregates},
booktitle = {In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data},
year = {1997},
pages = {159--170}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the "Cube" operator, which computes group-by aggregations over all possible subsets of the specified dimensions. The rapid acceptance of the importance of this operator has led to a variant of the Cube being proposed for the SQL standard. Several efficient algorithms for Relational OLAP (ROLAP) have been developed to compute the Cube. However, to our knowledge there is nothing in the literature on how to compute the Cube for Multidimensional OLAP (MOLAP) systems, which store their data in sparse arrays rather than in tables. In this paper, we present a MOLAP algorithm to compute the Cube, and compare it to a leading ROLAP algorithm. The comparison between the two is interesting, since although they are computing the same function, one is value-based (the ROLAP algorithm) whereas the other is position-based (the M...
