摘要： 数据立方体是数据仓库的核心数据模型，其对应的数据立方体格因保留上卷下钻的语义关系而有利于查询和导航。目前对数据立方体内部结构特性尚未展开系统的研究。为此，将数据立方体格视为图数据，研究数据立方体格的结构特性和解析模型。分析结果表明，不同于随机网络和复杂网络的模型，数据立方体格在度分布、聚集系数、平均最短路径等方面具有不同的结构特性。根据上述特性进一步建立数据立方体格的解析模型。

关键词: 数据立方体格, 复杂网络, 度分布, 平均最短路径, 聚集系数

Abstract: Data cubes are the core data model of data warehouses.The corresponding data cube lattices facilitate querying and navigation for its preserving semantics of rolling-up and drilling-down.But the intrinsic structure characteristics of data cubes have not yet been systematically researched.To address this issue,this paper studies the structure and the analytical model of data cubes from the graph view.The experimental results show that data cube lattices have different structural characteristics in degree distribution,aggregation coefficient,average shortest path and so on,compared with random networks and complex networks.Further the data cube lattice analytical model is established by utilizing the intrinsic structure characteristics.

Key words: data cube lattice, complex network, degree distribution, average shortest path, clustering coefficient

中图分类号: 

• TP311