无须附加空间的数据立方体联机聚集.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.17, No.4, April 2006, pp.806−813 DOI: 10. 1360/jos170806 Tel/Fax : +86-10 © 2006 by Journal of Software. All rights reserved. ∗ 无须附加空间的数据立方体联机聚集 + 李红松 , 黄厚宽 (北京交通大学 计算机与信息技术学院,北京 100044) Online Aggregation on Data Cubes Without Auxiliary Information + LI Hong-Song , HUANG Hou-Kuan (School of Computer Information Technology, Beijing Jiaotong University, Beijing 100044, China) + Corresponding author: Phn: +86-10 E-mail: hongsongli@, Li HS, Huang HK. Online aggregation on data cubes without auxiliary information. Journal of Software, 2006,17(4):806−813. /1000-9825/17/806.htm Abstract: Typically, online aggregation algorithms on multi-dimensional data need additional auxiliary data for estimation, which make the performance of the storage and maintenance of the data cube worse. This paper presents the PE (progressively estimate) and HPE (hybrid progressively estimate) to progressively estimate the answers for range queries in the QC-Trees. MPE (multiple progressively estimate) is also proposed to simultaneously evaluate batches of range-sum queries. The difference between the algorithms and other online aggregation algorithms on data cubes is that these algorithms do not need any auxiliary information. The idea of this estimation method is to utilize the data stored in the QC-Tree itself. As a result, this algorithm will not deteriorate the performance of the storage and maintenance of the data cubes. Analysis and experimental results show that the algorithms provide an accurate estimation in far less time than the normal algorithm