(Enter summary)
Abstract: The data cube and iceberg cube computation problem has been studied by many researchers. There are three major approaches developed in this direction: (1) top-down computation, represented by MultiWay array aggregation [22], which utilizes shared computation and performs well on dense data sets; (2) bottom-up computation, represented by BUC [6], which takes advantage of Apriori Pruning and performs well on sparse data sets; and (3) integrated top-down and bottom-up computation, represented by... (Update)
Similar documents based on text: More All
0.4: Star-Cubing: Computing Iceberg Cubes by Top-Down And.. - Xin, Han, Li, Wah (2003)
(Correct)
0.4: Efficient Computation of Iceberg Cubes with Complex Measures - Hah, Pei, Dong, Wang (2001)
(Correct)
0.2: Efficiently Computing the Top N Averages in Iceberg Cubes - Chou, Zhang
(Correct)
BibTeX entry: (Update)
Z. Shao, J. Han, and D. Xin. Mm-cubing: Computing iceberg cubes by factorizing the lattice space. to appear in the Proceedings of the 16th International Conference on Scientific and Statitistical Database Management (SSDBM), 2004. http://citeseer.ist.psu.edu/shao04mmcubing.html More
@inproceedings{ mm-cubing,
author = "Zheng Shao and Jiawei Han and Dong Xin",
title = "MM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice
Space",
booktitle = "Proceedings of the 16th International Conference on
Scientific and Statitistical Database Management (SSDBM)",
year = "2004",
url = "citeseer.ist.psu.edu/shao04mmcubing.html",
url = "http://citeseer.ist.psu.edu/shao04mmcubing.html" }
Citations (may not include all citations):
910
Fast algorithm for mining association rules
- Agrawal, Srikant
393
Data Cube: A Relational Aggregation Operator Generalizing Gr..
- Gray, Chaudhuri et al. - 1997
249
Mining Frequent Patterns without Candidate Generation
- Han, Pei et al.
248
Implementing data cubes efficiently
- Harinarayan, Rajaraman et al.
185
the computation of multidimensional aggregates
- Agarwal, Agreal et al.
161
Exploratory Mining and Pruning Optimizations of Constrained ..
- Ng, Lakeshmanan et al.
77
Bottom-up computation of sparse and iceberg cubes
- Beyer, Ramakrishnan
76
Materialized view selection in a multidimensional database
- Baralis, Paraboschi et al.
70
Fast Computation of sparse datacubes
- Ross, Srivastava
56
Data Cube approximation and histograms via wavelets
- Vitter, Wang et al.
33
Materialized view selection for multidimensional datasets (context) - Shukla, Deshpande et al.
31
Multi-Dimensional Regression Analysis of Time-Series Data St..
- Chen, Dong et al.
27
Compressed Data Cubes for OLAP Aggregate Query Approximation.. (context) - Shanmugasundaram, Fayyad et al.
19
Dwarf: Shrinking the PetaCube
- Sismanis, Deligiannakis et al.
17
Efficient computation of iceberg cubes with complex measures
- Han, Pei et al.
[Article contains additional citations not shown here]
Documents on the same site (http://www-sal.cs.uiuc.edu/~hanj/pubs/pub.htm): More
How Can Data Mining Help Bio-Data Analysis? (Extended Abstract) - Han (2002)
(Correct)
Clustering Moving Objects - Li, Han, Yang (2004)
(Correct)
CCMine: Efficient Mining of Confidence-Closed Correlated Patterns - Kim, Lee, Han
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC