A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf
.
Improving main memory utilization for array-based datacube computation
1998
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP - DOLAP '98
Computing datacubes requires multidimensional aggregations for all possible combinations of each dimension. In thii paper, we present a method to improve main memory utilization efficiency for an array-based algorithm for datacube computation in a MOLAP context. The problem with the array-based algorithm is in its sparsity, where a large pre portion of array cells are empty. ,The algorithm proposed in [ZDN97] reduces this space inefficiency by compressing arrays on disk. We improve on this
doi:10.1145/294260.294267
dblp:conf/dolap/MutoK98
fatcat:5kzbid7hnzeh5mszukgbbcdcly