期刊文献+

多路方体聚集完全立方体计算算法

AN ALGORITHM FOR COMPUTATION OF MULTI-WAY CUBOID AGGREGATION FULL CUBE
在线阅读 下载PDF
导出
摘要 数据立方体的预计算对于提高联机分析处理性能至关重要。在借鉴多路数组聚集完全立方体计算算法的基础上,提出了利用数据结果集驱动的完全立方体计算算法。算法在扫描完成一个方体的同时,完成方体沿各个维攀升形成的多个新方体的聚集值的计算,从而完成多路方体聚集。该算法支持大数据量立方体的计算。应用结果表明,算法可行,且易于实现。 The pre-computation of data cube is crucial to improving the efficiency of OLAP performance.Based on using the multi-way array aggregation full cube calculation algorithm as the reference,this article presents an algorithm of full cube calculation driven by the data result set.While a cube is completed the scanning,the algorithm implements the calculation of aggregation values of the new cubes which are generated by rolling up multiple dimension levels,therefore the multi-way cube aggregation is achieved.This algorithm supports calculating the cube with large data scale.The application results show that this algorithm is feasible and easy to implement.
出处 《计算机应用与软件》 CSCD 北大核心 2012年第9期104-106,共3页 Computer Applications and Software
基金 核高基重大专项(科技部国科发高[2011]141号)
关键词 多路方体聚集 完全立方体计算 数据立方体 多路数组聚集 OLAP Multi-way cuboid aggregation, Full cube computation ,Data cube, Multi-way array aggregation, OLAP
  • 相关文献

参考文献4

二级参考文献37

  • 1S. Agarwal, et al. On the computation of multi-dimensional aggregates. VLDB'96, Mumbai, India, 1996.
  • 2J. Gray, et al. Data Cube: A relational aggregation operator generalizing group-by, cross-table, and sub-total. ICDE'96,Louisiana, 1996.
  • 3Y. Zhao, et al. An array based algorithm for simultaneous multidimensional aggregates. SIGMOD' 97, Arizona, 1997.
  • 4V. Harinarayan, et al. Implementing data cubes efficiently.SIGMOD'96, Montreal, 1996.
  • 5K. Beyer, R. RamaKrishnan. Bottom-up computation of sparse and ice-berg cubes. SIGMOD'99, Pennsylvania, 1999.
  • 6J. Li, D. Rotem, J. Srivastava. Aggregation algorithms for very large compressed data warehouses. VLDB' 99, Scotland, 1999.
  • 7G. Sathe, S. Sarawagi. Intelligent rollups in multi-dimensional OLAP data. VLDB'01, Roma, 2001.
  • 8L.V.S. Lakshmanan, et al. Quotient cube: How to summarize the semantics of a data cube. VLDB'02, Hong Kong, 2002.
  • 9V.S. Laks, et al. QCTrees: An efficient summary structure for semantic OLAP. SIGMOD 2003, San Diego, CA, 2003.
  • 10Transaction Processing Performance Council TPC. TPC Benchmarks H and R (Decision support). Standard Specification,Transaction Processing Performance Council ( TPC ), 1999.http :∥www. tpc. org/.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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