首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于DWarf的语义压缩数据方体计算研究
引用本文:印莹,张斌,赵宇海.基于DWarf的语义压缩数据方体计算研究[J].华中科技大学学报(自然科学版),2005,33(Z1):243-246.
作者姓名:印莹  张斌  赵宇海
作者单位:东北大学,信息科学与工程学院,辽宁,沈阳,110004
基金项目:国家自然科学基金资助项目(6027307960473074)
摘    要:提出了一个可以减少磁盘访问次数的快速Dwarf计算算法Q-Dwarf,避免了在构建Dwarf过程中,计算汇总单元时不必要关闭结点的频繁I/O磁盘访问,节省了时间.并在此结构上构建查询算法以及增量维护算法.实验证明了一系列算法的效率和有效性,尤其适合数据仓库中的高维数据集.

关 键 词:数据立方计算  Q-Dwarf  聚簇  增量维护技术
文章编号:1671-4512(2005)S1-0243-04
修稿时间:2005年8月25日

Research on computation of dwarf-based semantic compression data cube
Yin Ying,Zhang Bin,Zhao Yuhai.Research on computation of dwarf-based semantic compression data cube[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2005,33(Z1):243-246.
Authors:Yin Ying  Zhang Bin  Zhao Yuhai
Institution:Yin Ying Zhang Bin Zhao Yuhai Doctoral Candidate,College of Information Science & Engineering,Northeastern University,Shenyang 110004,China.
Abstract:An optimized algorithm named Q-dwarf was proposed.The optimized algorithm guarantees that once the closed nodes are written to disk,they will not be read out again.Furthermore,The algorithms for querying and maintaining the dwarf data cube were proposed.The effectiveness and efficiency of the algorithms have been shown by experimental results,especially for the high dimension data warehouses.
Keywords:data cube computation  Q-dwarf  cluster  incrementally maintaining
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号