Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration

@inproceedings{Xin2003StarCubingCI,
  title={Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration},
  author={Dong Xin and Jiawei Han and Xiaolei Li and B. Wah},
  booktitle={VLDB},
  year={2003}
}
Data cube computation is one of the most essential but expensive operations in data warehousing. [...] Key Method The latter, represented by two algorithms: BUC [6] and H-Cubing[11], computes the iceberg cube bottom-up and facilitates Apriori pruning. BUC explores fast sorting and partitioning techniques; whereas H-Cubing explores a data structure, H-Tree, for shared computation. However, none of them fully explores multi-dimensional simultaneous aggregation. Expand
MM-Cubing: computing Iceberg cubes by factorizing the lattice space
  • Zheng Shao, Jiawei Han, Dong Xin
  • Computer Science
  • Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.
  • 2004
The Multi-Tree Cubing algorithm for computing iceberg cubes
PopUp-Cubing: An Algorithm to Efficiently Use Iceberg Cubes in Data Streams
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
Computing Iceberg Quotient Cubes with Bounding
Computing data cubes using exact sub-graph matching: the sequential MCG approach
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
Bottom-up computation of sparse and Iceberg CUBE
Condensed cube: an effective approach to reducing data cube size
Quasi-cubes: exploiting approximations in multidimensional databases
Implementing data cubes efficiently
...
1
2
3
...