摘要
就OLAP计算多维集成的性能瓶颈问题,给出了计算一系列分组的快速优化算法,基于排序的PipeSort算法和基于散列的PipeHash算法,并比较了二者之间的相对性能。
Two optimizing algorithms of fast - based a series of groups, Sort - based PipeSort algorithm and Hash- based PipeHash algorithm are given. The relative performances between PipeSort and PipeHash are compared.
出处
《湖南工程学院学报（自然科学版）》
2003年第2期68-71,共4页
Journal of Hunan Institute of Engineering(Natural Science Edition)
