摘要
With the rapid development of data warehouse and OLAP techniques, the researchers begin to pay atten-tion to the data mining in the data cube. Recently, Dr. T. Imielinski etc. firstly presented the problem of the cubegradient mining that is a generalization of association rule in data cube. In this paper, we firstly introduce the relatedconcepts of data cube and condensed cube with an emphasis. Then we introduce some interesting problems related tothe cube gradient mining including: constrained cube gradient mining and the query language of cube gradient. Final-ly, we introduce several issues on the combination of cube gradient and the condensed cube, that is, the cube gradientmining in the materialized data cube and the integration of cube gradient mining and cube browse.
With the rapid development of data warehouse and OLAP techniques, the researchers begin to pay attention to the data mining in the data cube. Recently, Dr. T. Imielinski etc. firstly presented the problem of the cube gradient mining that is a generalization of association rule in data cube. In this paper, we firstly introduce the related concepts of data cube and condensed cube with an emphasis. Then we introduce some interesting problems related to the cube gradient mining including: constrained cube gradient mining and the query language of cube gradient. Finally , we introduce several issues on the combination of cube gradient and the condensed cube, that is, the cube gradient mining in the materialized data cube and the integration of cube gradient mining and cube browse.
出处
《计算机科学》
CSCD
北大核心
2003年第5期37-41,共5页
Computer Science
