Hierarchical Compact Cube for Range-Max Queries
Sin Yeung Lee, Tok Wang Ling, Huagang Li · 2000
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous values for each dimension. One of the approaches to process such queries is to precompute a prefix cube (PC), which is a cube of the same dimensionality and size as the original data cube, but with some pre-computed results stored in each cell.