摘要: 基于BUC算法,该文提出PBUC算法用于不完整数据立方的自底向上计算。为了充分利用BUC算法的关键优化策略-共享划分,提出一个确定维顺序的新策略。一旦维顺序被确定,除了PBUC忽略不需计算的数据小方之外,PBUC的计算过程与BUC基本一致。
关键词:
数据立方,
聚集,
完整数据立方,
不完整数据立方,
BUC
Abstract: Basd on algorithm BUC, the paper proposes a new algorithm PBUC for partial data cube. To make good use of the key optimization: share-partition, PBUC algorithm proposes a new heuristic for ordering the dimensions.When the dimension ordering is finished, the procession of PBUC is almost same with that of BUC except that PBUC skips the cuboids which needn't be computed.
中图分类号:
吴永英,袁芳,向隆刚. 不完整数据立方的自底向上计算[J]. , 2002, 28(12): 113-115.
WU Yongying, YUAN Fang, XIANG Longgang. Bottom-up Computation for Partial Data Cube[J]. , 2002, 28(12): 113-115.