期刊文献+

不完整数据立方的自底向上计算

Bottom-up Computation for Partial Data Cube
下载PDF
导出
摘要 基于BUC算法,该文提出PBUC算法用于不完整数据立方的自底向上计算。为了充分利用BUC算法的关键优化策略-共享划分,提出一个确定维顺序的新策略。一旦维顺序被确定,除了PBUC忽略不需计算的数据小方之外,PBUC的计算过程与BUC基本一致。 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.
出处 《计算机工程》 CAS CSCD 北大核心 2002年第12期108-110,共3页 Computer Engineering
基金 国家科技部"十五"电子政务攻关项目(2001BA110B01)
关键词 不完整数据立方 数据库 BUC算法 PBUC算法 排序 Data cube;Aggregation;Full cube;Partial cube;BUC
  • 相关文献

参考文献6

  • 1[1]Baeyer K,Ramakrishnan R. Bottom-up Computation of Sparse and Iceberg CUBEs.In Proceedings of ACM SIGMOD InternationalConference on Management of Data,Philadephia,Pennsylvania, USA, ACM Press,1999-06:359-370
  • 2[2]Sarawagi S,Agrawal R,Gupta A.On Computing the Data Cube.Technical Report RJ10026,IBM Almaden Research Center,San Jose, CA, 1996
  • 3[3]Gray J,Bosworth A,Layman A,et al. Datacube:A Relational Aggregation Operator Generalizing Group by,Cross-tab,and Sub-totals.In Proc. of the IEEE ICDE, 1996:152-159
  • 4[4]Ross K A, Strivastava D.Fast Computation of Sparse Datacubes.In Proc. of the 23rd VLDB Conf.,Athens,Greece, 1997:116-125
  • 5[5]Zhao Y,Desgpande P M,Naughton J F.An Array-based Algorithm forSimultaneous Multi-dimensional Aggregates.In Proc. of the ACM SIGMOD Conf.,1997:159-170
  • 6[6]Sarawagi S,Agrawal R,Gupta A.On Computing the Data Cube. Tech nical Report RJ10026,IBM Almaden Research Center, San Jose,CA, 1996

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部