期刊文献+

基于压缩的属性划分存储结构及其上OLAP操作

A compression-based attribute partition storage structure and OLAP queries
下载PDF
导出
摘要 信息量的急剧膨胀向数据库工作者提出了挑战。如何有效地管理这些海量数据是学术界和工业界面临的一个重要问题。将数据压缩技术与海量数据仓库有机结合,提出了基于压缩的属性划分存储结构。不仅可以支持压缩数据上的直接操作,而且利用维属性上的布尔运算提高了OLAP操作的性能,减少了计算量。理论分析结果表明,该数据压缩方法可以获得很高的数据压缩比。 The tremendous increase of information give a great challenge to DB researchers. How to organize the massive data efficiently becomes an important issue both on the academic and industry fields. The authors studied the compressing problem on the massive data warehouse, and proposed a storage structure based on compressed attribute partition which compresses the data set by coding the dimension attributes. Not only can it support operations directly on compressed datasets without the need to first decompress them, but also reduce the computation. The boolean operation on dimensional attributes also improves the OLAP performance. The analytical results show that we can obtain very high compression ratio and efficiency by this kind of compression storage structure.
出处 《黑龙江大学自然科学学报》 CAS 2002年第2期53-57,共5页 Journal of Natural Science of Heilongjiang University
基金 国家自然科学基金资助项目(69873014) 国家973计划基金资助项目(G1999032704)
关键词 压缩数据仓库 属性划分 编码 OLAP 联机分析处理 compressed data warehouse attribute partition coding OLAP(On Line Analysis Processing)
  • 相关文献

参考文献12

  • 1[1]GUPTA A, MUMICK I S. Maintenance of Materialized View: Problems, Techniques and Applications [J]. Data Eng Bulletin, 1995, 18 (2): 3- 18.
  • 2[2]ZHUGE Y, GARCIA-MOLINA H, HAMMER J, et al. View Maintenance in a Warehousing Environment[A]. ACM. Proceeding of ACM SIGMOD Conference[C]. San Jose: ACM, 1995. 316-327.
  • 3[3]GRAY J. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab and Sub-Totals [A]. IEEE International Conference on Data Engineering[C]. New Orleans: IEEE, 1996. 131-139.
  • 4[4]WU Ming-chun, BUCHMANN A P. Encoded Bitmap Indexing for Data Warehouses [A]. IEEE. International Conference on Data Engineering[C]. Florida: IEEE, 1998.220-230.
  • 5[5]CHAN C, Y E IOANNIDIS. Bitmap Index Design and Evaluation [A]. ACM. Proceedings of ACM SIGMOD Conference [C]. New York: ACM, 1998. 355-366.
  • 6[6]CHAN C,Y E IOANNIDIS. An Efficient Bitmap Encoding Scheme for Selection Queries [A]. ACM. Proceedings of ACM SIGMOD Conference[C]. Washington: ACM, 1999. 215-226.
  • 7[7]O'NEIL P, QUASS D. Improved Query Performance with Variant Indexes[A]. ACM. Proceedings of ACM SIGMOD Conference[C]. Sydney: ACM, 1997. 38-49.
  • 8[8]STOHR T, MARTENS H. Multi-Dimensional Database Allocation for Parallel Data Warehouses [A]. IEEE. Proceedings of 26th VLDB Conference[C]. Egypt: IEEE, 2000.273-284.
  • 9[9]ZHAO Y, DESHPANDE P M, NAUGHTON J F. An Array-Based Algorithm for Simultaneous Multidimensional Aggregates[A]. ACM. Proceedingsof ACM SIGMOD Conference[C]. Sydney: ACM, 1997. 159-170.
  • 10[10]LI Jian-zhong, ROTEM DORON, SRIVASTAVA JAIDEEP. Aggregation Algorithms for Very Large Compressed Data Warehouses[A]. IEEE. Proceedings of the 25th VLDB Conference [C]. Edinburgh: IEEE, 1999. 651-662

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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