Title :
Multi-cube computation
Author :
Yu, Jeffrey Xu ; Lu, Hongjun
Author_Institution :
Dept. of Syst. Eng. & Eng. Manage., Chinese Univ. of Hong Kong, Shatin, China
Abstract :
Computing an n-attribute datacube requires the computation of an aggregate function over all groups generated by 2/sup n/ interrelated GROUP-BYs. In this paper, we focus on multi-cube computation. We extend the algorithms for single datacube computation to process multiple datacubes simultaneously. The issue we intend to explore is the memory utilization. We propose two multi-cube algorithms, namely, a sort-based algorithm and a hash-based algorithm. Different data skews and sparsities are investigated. Results from our extensive performance studies are reported.
Keywords :
data mining; data warehouses; database theory; aggregate function; data skews; data sparsities; hash-based algorithm; interrelated GROUP-BYs; memory utilization; multi-cube computation; n-attribute datacube; sort-based algorithm; Aggregates; Communication industry; Cost function; Data analysis; Industrial relations; Information analysis; Information systems; Manufacturing industries; Manufacturing processes; Transportation;
Conference_Titel :
Database Systems for Advanced Applications, 2001. Proceedings. Seventh International Conference on
Conference_Location :
Hong Kong, China
Print_ISBN :
0-7695-0996-7
DOI :
10.1109/DASFAA.2001.916373
