Computing the Data Cube

• Naïve 2^N algorithm

  • N = # dimensions

• General optimization techniques

  • order aggregation to minimize data move
  • use hashing
  • exploit parallelism

Previous slide

Next slide

Back to first slide

View graphic version