Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach
IEEE Transactions on Knowledge and Data Engineering
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Computing data cubes using exact sub-graph matching: the sequential MCG approach
Proceedings of the 2009 ACM symposium on Applied Computing
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
BitCube: A Bottom-Up Cubing Engineering
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Exact and Approximate Sizes of Convex Datacubes
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Mining significant change patterns in multidimensional spaces
International Journal of Business Intelligence and Data Mining
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
An efficient method for maintaining data cubes incrementally
Information Sciences: an International Journal
Double table switch: an efficient partitioning algorithm for bottom-up computation of data cubes
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
Extracting semantics in OLAP databases using emerging cubes
Information Sciences: an International Journal
Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs
Information Sciences: an International Journal
On the computation of maximal-correlated cuboids cells
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Using functional dependencies for reducing the size of a data cube
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
A framework and a language for on-line analytical processing on graphs
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2) closed cube, where a group of cells which preserve roll-up/drill-down semantics are losslessly compressed to one cell. Due to its usability and importance, efficient computation of closed cubes still warrants a thorough study. In this paper, we propose a new measure, called closedness, for efficient closed data cubing. We show that closedness is an algebraic measure and can be computed efficiently and incrementally. Based on closedness measure, we develop an an aggregation-based approach, called C-Cubing (i.e., Closed-Cubing), and integrate it into two successful iceberg cubing algorithms: MM-Cubing and Star-Cubing. Our performance study shows that C-Cubing runs almost one order of magnitude faster than the previous approaches. We further study how the performance of the alternative algorithms of C-Cubing varies w.r.t the properties of the data sets.