Efficient Computation of Iceberg Cubes with Complex Measures
Summary: Efficient iceberg-cube computation with complex measures (average) via a weaker anti-monotonic prune to shrink search space. Introduces Top-k Apriori/BUC and H-tree based Top-k H-Cubing; Top-k H-Cubing often yields best scalability. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jiawei Han
- 2. Jian Pei
- 3. Guozhu Dong
- 4. Ke Wang
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,498 | Cubetree: Organization of and Bulk Incremental Updates on the Data Cube | 1997 | SIGMOD | 7.0389539e-05 |
| 7,081 | The Polynomial Complexity of Fully Materialized Coalesced Cubes | 2004 | VLDB | 4.8413336e-05 |
| 4,444 | Hierarchical Cubes for Range-Sum Queries | 1999 | VLDB | 6.1831691e-05 |
| 12,690 | Hierarchical Compact Cube for Range-Max Queries | 2000 | VLDB | 4.1945683e-05 |
| 3,157 | High-Dimensional OLAP: A Minimal Cubing Approach | 2004 | VLDB | 7.4656511e-05 |
| 247 | On the Computation of Multidimensional Aggregates | 1996 | VLDB | 0.00030927763 |
| 597 | Computing Iceberg Queries Efficiently | 1998 | VLDB | 0.00019475592 |
| 9,688 | Iceberg-cube Computation with PC Clusters | 2001 | SIGMOD | 4.3047774e-05 |
| 472 | Bottom-Up Computation of Sparse and Iceberg CUBEs | 1999 | SIGMOD | 0.00022346384 |
| 2,190 | Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration | 2003 | VLDB | 9.3317645e-05 |