In complex data warehouse applications, high dimensional data cubes can become very big. The quotient cube is attractive in that it not only summarizes the original cube but also it keeps the roll-up and drill-down semantics between cube cells. In this paper we study the problem of semantic summarization of iceberg cubes, which comprises only cells that satisfy given aggregation constraints. We propose a novel technique for identifying groups of cells based on bounding aggregates and an efficient algorithm for computing iceberg quotient cubes for monotone functions. Our experiments show that iceberg quotient cubes can reduce data cube sizes and our iceberg quotient cubing algorithm can be over 10-fold more efficient than the current approach. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Zhang, X., Chou, P. L., & Ramamohanarao, K. (2006). Computing iceberg quotient cubes with bounding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4081 LNCS, pp. 145–154). Springer Verlag. https://doi.org/10.1007/11823728_14
Mendeley helps you to discover research relevant for your work.