期刊文献+

基于时态层次链的Data Cube多版本维护方案 被引量:1

A Multi-Version Maintain Scheme of Data Cube Based on Temporal Hierarchy Chains
下载PDF
导出
摘要 针对Data Cube的模式变动造成的多版本问题,对时态聚集关系与时态层次链进行了形式化描述,并基于这些关系实现了多个版本的Data Cube的统一生成算法,不仅可以高效地进行Data Cube多个版本的维护,而且在OLAP查询也可以基于时态层次链来执行,从而提高系统的整体效率。 This article first gives formalization definitions of temporal aggregation relation and temporal hierarchy chain for solving the data cube's multi-version problem caused by pattern's changes.Then a uniform algorithm for generating the multi-version data cube is proposed.It cannot only maintain the multi-version data cube effectively but also optimize the OLAP queries based on temporal hierarchy chains and thus the efficiency of system is improved.
作者 肖磊 胡众义
出处 《计算机系统应用》 2010年第1期161-164,共4页 Computer Systems & Applications
关键词 时态层次链 多维数据集 多版本维护 temporal hierarchy chains data cube multi-version maintain
  • 相关文献

参考文献9

  • 1Gray J, Bosworth A, Layman A, Pirahesh H. Data Cube:A Relational Aggregation Operator Generalizing Group-By,Cross-Tab,and Sub-Totals.IEEE Inf.Conf. Data Zngineering, New Orleans, Louisiana, 1996, 152 - 159.
  • 2Rizzi S, Golfarelli M. X-time: schema versioning and cross-version querying in data warehouses. Proc. of the International Conference on Data Engineering (ICDE). 2007.
  • 3Jouini K, Jomier G Indexing multiversion databases. Proc. of ACM Conference on Information and Knowledge Management (CIKM). 2007.
  • 4Mendelzon AO, Vaisman AA. Temporal queries in OLAP. Proc. of the International Conference on Very Large Data Bases (VLDB). 2000.
  • 5Transaction Processing Performance Council TPC. TPC benchmarks H and R (decision support)(OL). Standard Specification,Transaction Processing Performance Council (TPC).October 1999. http://www, tpc.org/.
  • 6Beyer K, Ramakrishnan R. Bottom-up computation of sparse and iceberg CUBEs. Proc. of the ACM SIG MOD Int' l Conf. on Management of Data. ACM Press, 1999.
  • 7Sismanis Y, Deligiannakis A, Roussopoulos N, et al. Dwarf: Shrinking the Peta Cube. Proc. of ACM SIGMOD Int'l Conf. on Management of Data. Madison, USA: ACM Press, 2002.
  • 8Lakshmanan L, Pei Jian, Zhao Yan. QC-trees: An efficient summary structure for semantic OLAP. Proc. of ACM SIGMOD International Conference on Management of Data. New York, USA, 2003.
  • 9师智斌,黄厚宽,刘红敏.一种保持语义的压缩数据立方体结构[J].计算机工程,2008,34(13):37-39. 被引量:2

二级参考文献6

  • 1Gray J, Bosworth A, Layman A, et al. Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-tab, and Sub-totals[C]//Proc. of the 12th Int'l Conf. on Data Engineering. New Orleans, USA:IEEE Computer Society, 1996.
  • 2Sismanis Y, Deligiannakis A, Roussopoulos N, et al. Dwarf: Shrinking the Peta Cube[C]//Proc. of ACM SIGMOD Int'l Conf. on Management of Data. Madison, USA: ACM Press, 2002.
  • 3Lakshmanan L. Quotient Cube: How to Summarize the Semantics of a Data Cube[C]//Proc. of the 23rd Int' l Conf. on Very Large Data Bases. Hong Kong, China: Morgan Kaufmann, 2002.
  • 4Lakshmanan L, Pei Jian, Zhao Yan. QC-trees: An Efficient Summary Structure for Semantic OLAP[C]//Proceedings of ACM SIGMOD International Conference on Management of Data. New York, USA: [s. n.], 2003.
  • 5Beyer K, Ramakrishnan R. Bottom-up Computation of Sparse and Iceberg CUBEs[C]//Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. [S. l.]: ACM Press, 1999.
  • 6Hahn C. Edited Synoptic Cloud Reports from Ships and Land Stations over the Globe[Z]. (2006-10-12). www.1982-1991.cdiac. est.ornl.gov/ftp/ndp026b/S EP85L.Z 1994.

共引文献1

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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