| 基于层次聚簇的Cube存储结构的研究 |
| |
| 引用本文： | 叶德谦,王桂兰,张杰.基于层次聚簇的Cube存储结构的研究[J].计算机工程与应用,2005,41(9):174-176. |
| |
| 作者姓名： | 叶德谦 王桂兰 张杰 |
| |
| 作者单位： | 燕山大学中德信息技术合作研究所,秦皇岛,066004 |
| |
| 基金项目： | 教育部留学回国人员科研基金(编号:2001498) |
| |
| 摘 要： | 数据仓库中的维数据通常都是有层次的,基于维层次路径的聚簇能有效地在物理空间上将关联数据组织到一起,减少查询访问磁盘的次数。而现在的Cube存储结构都关注于Cube操作的计算和存储,忽视了这一特点。论文提出基于维层次聚簇的Cube存储结构HC(HierarchicallyClustered)Cube及相关算法,解决了目前存在的问题。
|
| 关 键 词： | 区域查询 层次聚簇 立方体 UB-树 |
| 文章编号： | 1002-8331-(2005)09-0174-03 |
Reseach on Cube Storage Structure Based on Hierarchically Clustered |
| |
| Ye Deqian,Wang Guilan,Zhang Jie.Reseach on Cube Storage Structure Based on Hierarchically Clustered[J].Computer Engineering and Applications,2005,41(9):174-176. |
| |
| Authors: | Ye Deqian Wang Guilan Zhang Jie |
| |
| Abstract: | For dimensions in the datahouse are usually organized in hierarchies,the hierarchically clustering based on the hierarchy paths of the dimensions can effectively put the related data physically together and decrease the access on the disks.But now the recent cube data structures deal with the computation and storage of the data cube operator and omit such a significant aspect in OLAP.In this paper,we proposed a cube storage structure based on the dimension's hierarchically clustering called HC Cube and the related algorithm and solved the current problem. |
| |
| Keywords: | range queries hierarchically clustered Cube UB-Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
