A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Efficient aggregation algorithms on very large compressed data warehouses
2000
Journal of Computer Science and Technology
Multidimensional aggregation and Cube are dominant operations for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. Some work has been done on how to efficiently compute the Cube on data warehouses which store multidimensional datasets in arrays rather than in tables. However, to our knowledge, there is nothing to date in the literature on aggregation algorithms on compressed data warehouses
doi:10.1007/bf02948809
fatcat:ja2wykdfh5g5hhchx37tzciena