Hi,
Say you have a database with 2 dense dimensions with middling block size and 5 sparse dimensions with hierarchies that need aggregating, which between them will easily take Essbase into the second 2^52 group, though being a low way shy of the second limit. Data is spread very sparsely across the dimensions with less than 0.09% of the potential sparse combinations populated.
Also imagine that the lions share of its data will be loaded from other systems, so form based aggregation strategies are not useful to you, and external pre-aggregated data is also not possible.
Also assume dimensional ordering is optimal.
Are there any useful strategies that can be employed to minimise the aggregation times in PBCS.
thanks for your input,
Robert.