Abstract
Effective pruning is essential for efficient iceberg cube computation. Previous studies have focused on exclusive pruning: regions of a search space that do not satisfy some condition are excluded from computation. In this paper we propose inclusive and anti-pruning. With inclusive pruning, necessary conditions that solutions must satisfy are identified and regions that can not be reached by such conditions are pruned from computation. With anti-pruning, regions of solutions are identified and pruning is not applied. We propose the multiway pruning strategy combining exclusive, inclusive and anti-pruning with bounding aggregate functions in iceberg cube computation. Preliminary experiments demonstrate that the multiway-pruning strategy improves the efficiency of iceberg cubing algorithms with only exclusive pruning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of VLDB 1994, Santiago, Chile, pp. 487–499 (1994)
Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proc. of SIGMOD 1998, pp. 85–93 (1998)
Beyer, K., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Proc. of SIGMOD (1999)
Chou, L., Zhang, X.: Computing Complex Iceberg Cubes by Multiway Aggregation and Bounding. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 108–117. Springer, Heidelberg (2004)
Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: Proc. of KDD 1999, San Diego, USA, pp. 15–18 (1999)
Gray, J., et al.: Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1(1) (1997)
Han, J., Pei, J., Dong, G., Wang, K.: Efficient computation of iceberg cubes with complex measures. In: Proc. of SIGMOD 2001 (2001)
Ng, R., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. of SIGMOD 1998 (1998)
Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. of ICDE 2001 (2001)
Wang, K., et al.: Divide-and-approximate: A novel constraint push strategy for iceberg cube mining. IEEE TKDE 17(3), 354–368 (2005)
Webb, G.I.: Inclusive pruning: a new class of pruning rules for unordered search and its application to classification learning. In: Proc. of ACSC 1996 (1996)
Zhang, X., Chou, L., Dong, G.: Efficient computation of iceberg cubes by bounding aggregate functions. IEEE TKDE (in submission)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Chou, P.L. (2006). Multiway Pruning for Efficient Iceberg Cubing. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_20
Download citation
DOI: https://doi.org/10.1007/11827405_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)