摘要
根据 data cube层次性的特点和查询习惯提出了新的分块计算方法 ,并在此基础上提出了改进算法 .这种方法节约了存储空间 ,在 L BD粒度及其上的查询效率为 O(1 ) ,同时数据的更新时间大约为 O() ,还节约了大量的存储空间 ,并且使得数据立方具有了一定的结构独立性 ,能有效的减少重新构造数据立方 (reprocess)的次数 。
In the paper, the author reviews R. Agrawal and other scholars' research in this respect, introduces their algorithms & presents new two algorithms to divide blocks according to the characteristic of range order of data cube & query custom.The new algorithm presented in the paper is characterized with such strong points as saving space, increasing efficiency in the circumstance of large granularity & processing structural independence which efficiently reduces the time of reprocess.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第11期2020-2023,共4页
Journal of Chinese Computer Systems
