Skip to main content

Efficient computation of iceberg cubes with complex measures

Publication ,  Journal Article
Han, J; Pei, J; Dong, G; Wang, K
Published in: SIGMOD Record (ACM Special Interest Group on Management of Data)
January 1, 2001

It is often too expensive to compute and materialize a complete high-dimensional data cube. Computing an iceberg cube, which contains only aggregates above certain thresholds, is an effective way to derive nontrivial multidimensional aggregations for OLAP and data mining. In this paper, we study efficient methods for computing iceberg cubes with some popularly used complex measures, such as average, and develop a methodology that adopts a weaker but anti-monotonic condition for testing and pruning search space. In particular, for efficient computation of iceberg cubes with the average measure, we propose a top-k average pruning method and extend two previously studied methods, Apriori and BUC, to Top-k Apriori and Top-k BUC. To further improve the performance, an interesting hypertree structure, called H-tree, is designed and a new iceberg cubing method, called Top-k H-Cubing, is developed. Our performance study shows that Top-k BUC and Top-k H-Cubing are two promising candidates for scalable computation, and Top-k H-Cubing has better performance in most cases.

Duke Scholars

Altmetric Attention Stats
Dimensions Citation Stats

Published In

SIGMOD Record (ACM Special Interest Group on Management of Data)

DOI

ISSN

0163-5808

Publication Date

January 1, 2001

Volume

30

Issue

2

Start / End Page

1 / 12

Related Subject Headings

  • Information Systems
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Han, J., Pei, J., Dong, G., & Wang, K. (2001). Efficient computation of iceberg cubes with complex measures. SIGMOD Record (ACM Special Interest Group on Management of Data), 30(2), 1–12. https://doi.org/10.1145/376284.375664
Han, J., J. Pei, G. Dong, and K. Wang. “Efficient computation of iceberg cubes with complex measures.” SIGMOD Record (ACM Special Interest Group on Management of Data) 30, no. 2 (January 1, 2001): 1–12. https://doi.org/10.1145/376284.375664.
Han J, Pei J, Dong G, Wang K. Efficient computation of iceberg cubes with complex measures. SIGMOD Record (ACM Special Interest Group on Management of Data). 2001 Jan 1;30(2):1–12.
Han, J., et al. “Efficient computation of iceberg cubes with complex measures.” SIGMOD Record (ACM Special Interest Group on Management of Data), vol. 30, no. 2, Jan. 2001, pp. 1–12. Scopus, doi:10.1145/376284.375664.
Han J, Pei J, Dong G, Wang K. Efficient computation of iceberg cubes with complex measures. SIGMOD Record (ACM Special Interest Group on Management of Data). 2001 Jan 1;30(2):1–12.

Published In

SIGMOD Record (ACM Special Interest Group on Management of Data)

DOI

ISSN

0163-5808

Publication Date

January 1, 2001

Volume

30

Issue

2

Start / End Page

1 / 12

Related Subject Headings

  • Information Systems