基于维层次性的Data Cube存储优化方法  

Storage optimization method of Data Cube based on hierarchy of dimension

作　　者：杨科华[1] 胡孔法[1] 

机构地区：[1]东南大学计算机科学与工程系,南京210096

出　　处：《东南大学学报（自然科学版）》2005年第4期524-527,共4页Journal of Southeast University：Natural Science Edition

基　　金：江苏省"九五"重点攻关基金资助项目(BG980171);江苏省"十五"高科技基金资助项目(BG2001013).

摘　　要：根据DataCube模式中维的层次性,提出了层次式B+树及维层次编码的概念,并应用于层次树形Cube(HTCube)方法中.HTCube将维划分为聚集维与分析维,在分析维上利用层次式B+树除去了冗余数据,并在查询过程中形成维层次编码,在聚集维上则利用维层次编码组合而成的分析维编码进行索引,从而可以高效地检索到聚集值.理论分析和实验证明,该方法不但节省了存储空间,而且可利用层次信息高效地进行各种OLAP查询,为DataCube模式更新、OLAP查询导航和OLAP查询行为分析的实现提供了可能.According to the hierarchy of dimension in the data cube pattern, this paper brings forward the conception of hierarchical B^＋ tree and dimension hierarchical encoding, and applies both to the hierarchical tree （HT） cube method. HT Cube divides the dimension into cluster dimension and analysis dimensions. On the analysis dimension, hierarchical B^＋ tree is used to remove redundancy and form dimension hierarchical encoding. On the dimension of cluster, code of the analysis dimensions, which is composed of dimensional hierarchical code, is used to make index. Thus, the value of cluster will be searched out effectively. Theoretical analysis and experiments prove that this method saves the storage space and can carry out a variety of OLAP （on-line analysis process） queries with high efficiency. This method makes it possible to realize the data cube pattern update, query wizard of OLAP query and the analysis of OLAP query behavior.

关 键 词：层次树形Cube 层次式B^+树 维层次编码 联机分析处理 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]