多维数据集的一种高效层次聚集存储结构  

An Efficient Hierarchical Cluster Storage Structure of Multi-dimensional Data

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

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

出　　处：《应用科学学报》2005年第4期393-398,共6页Journal of Applied Sciences

摘　　要：根据多维数据集模式中维的层次性提出了层次式B+树(hierarchicalB+tree,HB+tree)与层次聚集CUBE(hierarchicalclusterCUBE,HCDC)的概念,并应用于多维数据集数据的保存与查询中.利用保存的层次信息,对多维数据集查询与更新效率进行了优化,且支持多维数据上的上钻、下钻、旋转操作,且层次存储结构也使得多维数据集模式更新操作成为可能,从而更好地满足实际应用.In this article, the concept of hierarchical B + tree and hierarchical cluster CUBE is put forward according to the hierarchy of dimension in the multi-dimensional schema which has been applied in the preserving and querying of multi-dimensional data. According to this concept, the querying and updating with the hierarchical information have been optimized. The roll-up, roll-down and rotating operation are also supported. Furthermore, the hierarchical structure enables the updating operation of the multi-dimension data's schema.

关 键 词：联机分析处理 层次式B^+树 层次聚集CUBE 

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