|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
22nd International Conference on Data Engineering (ICDE'06)
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
Atlanta, Georgia
April 03-April 07
ISBN: 0-7695-2570-9
| ASCII Text | x | ||
| Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu, "C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking," Data Engineering, International Conference on, pp. 4, 22nd International Conference on Data Engineering (ICDE'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDE.2006.31, author = {Dong Xin and Zheng Shao and Jiawei Han and Hongyan Liu}, title = {C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking}, journal ={Data Engineering, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2570-9}, pages = {4}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.31}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Data Engineering, International Conference on TI - C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking SN - 0-7695-2570-9 SP EP A1 - Dong Xin, A1 - Zheng Shao, A1 - Jiawei Han, A1 - Hongyan Liu, PY - 2006 KW - null VL - 0 JA - Data Engineering, International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.31
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.
Citation:
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu, "C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking," icde, pp.4, 22nd International Conference on Data Engineering (ICDE'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.