期刊文献+

基于浓缩数据立方的内存实化小方的动态选择 被引量:1

Dynamic Main-memory Materialized Cuboids Selection in Condensed Cube
下载PDF
导出
摘要 OLAP通常使用预计算数据立方的方法提高可能的聚集查询的响应速度,在内存实化预计算的数据,可以更进一步加快响应的速度,但是受到内存空间的限制。在浓缩数据立方的环境中,动态地选择一定的数据小方在内存实化,加快响应速度,并更好地适应不同的查询模式。给出了在动态选择模型中,特定存储方式下的查询分解和响应算法。 Pre-computing data cube is an ordinary way to improve the response time of possible aggregate queries. Further more, some cuboids are often materialized in main memory to further speed up queries. But it is limited by the size of main memory. This paper proposes a way to select dynamically some cuboids of condensed cube for materializing in main memory, and gives the way to reduce query to sub-queries and the algorithm of answering queries.
出处 《计算机应用研究》 CSCD 北大核心 2005年第7期14-17,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60303030)
关键词 浓缩数据立方 动态选择 数据小方 Condensed Cube Dynamic Selection Cuboids
  • 相关文献

参考文献8

  • 1Shukla A, Deshpande P, Naughton J F.Materialized View Selection for Multi-dimensional Datasets [C].New York: Proceedings of VLDB'98,1998. 488- 499.
  • 2Kenneth A Ross, Kazi A Zaman. Setting Datacube Tuples from Main Memory[C]. SSDBM,2000. 182- 195.
  • 3Wiiiiam H Press, Saul A Teukolsky, William T Vetterling, et al. Numerical Recipes in C: the Art of Scientific Computing(2nd Edition)[M]. Cambridge University Press, 1988. 274-290.
  • 4C Hahn, S Warren, J London. Edited Synoptic Cloud Report from Ships and Land Station,s oser the Globe[EB/OL]. http://cdiac.esd. ornl. gov/cdiac/ndps/ndp026b. html,http://ediac.esd. ornl.gov/ftp/ndp026b/SEP85L. DAT. Z.
  • 5Harinarayan V, Rajaraman A, Ullman J D. Implementing Data Cubes Efficiently[C]. Proceedings of SIGMOD '96, Montreal : ACM Press,1996. 205-216.
  • 6Kotidis Y, Roussopoulos N. DynaMat: A Dynamic View Management System for Data Warehouses [C]. Proceedings of SIGMOD '99, Philadelphia : ACM Press, 1999.371 - 382.
  • 7Wei Wang, Jianlin Feng, Hongjun Lu, et al. Condensed Cube: An Effective Approach to Reducing Data Cube Size[C]. San Jose: Proc.of the 18th Intl. Cotff. on Data Engineering, 2002.
  • 8Jianlin Feng, Hongjie Si,Yucai Feng. Indexing and Incremental Updating Condensed Data Cube[C].Cambridge: the 15th International Confereuce on Scientific. and Statistical Database Management, 2003.

同被引文献7

  • 1Goldstein J, Larson P. Optimizing queries using materialized views: a practical, sealable solutions[C]//Proc of the ACM SIGMOD Int'l Conf on Management of Data. New York: ACM Press, 2001: 331-342.
  • 2Burdick D, Deshpande P M, Jayram T S, et al. OLAP over uncertain and imprecise data[J]. VLDB Journal, 2007, 16(1): 123-144.
  • 3Chirkova R, Li C, Li J. Answering queries using materialized views with minimum size[J]. VLDB Journal, 2006, 15(3):191-210.
  • 4Bernstein P. The Asilomar report on database researeh[J]. ACM SIGMOD Record, 1998, 27(4) : 79- 84.
  • 5Ross K, Zaman K. Serving datacube tuples from main memory[C] // Proceedings of the IEEE Interna tional Conferrence on Scientific and Statistical Database Management. Washington: IEEE Computer Society, 2000: 182-195.
  • 6Wang W, Feng J, Lu H, et al. Condensed cube: an effective approach to reducing data cube size [C]// Proceedings of the 18th International Conference on Data Engineering. Washington.. IEEE Computer Society, 2002: 155-165.
  • 7Feng J, Si H, Feng Y. Indexing and incremental updating condensed cube[C] // Proceedings of the 15th International Conference on Scientific and Statistical Database Management. Washington: IEEE Computer Society, 2003: 23-32.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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