Mining constrained cube gradient for materialized cube

Constrained cube gradient mining is an important mining task that has broad applications. The existing works always explore the constrained cube gradient in the case of non-materialized cube, that is, the computation of the data cube from relation table is an important task of the mining algorithms. In fact, in the data warehouse environment, in order to enhance the response time of OLAP analysis, there are always lots of materialized cube that have been computed in advance. In this paper, we consider the problem of mining condensed cube gradient in the case of materialized cube. A novel mining algorithm based on condensed cube is presented. The test of performance shows our algorithm is also presented.