Abstract
Iceberg cubing is a valuable technique in data warehouses. The efficiency of iceberg cube computation comes from efficient aggregation and effective pruning for constraints. In advanced applications, iceberg constraints are often non-monotone and complex, for example, “Average cost in the range [δ 1, δ 2] and standard deviation of cost less than β”. The current cubing algorithms either are efficient in aggregation but weak in pruning for such constraints, or can prune for non-monotone constraints but are inefficient in aggregation. The best algorithm of the former, Star-cubing, computes aggregations of cuboids simultaneously but its pruning is specific to only monotone constraints such as “COUNT(*) ≥ δ”. In the latter case, the Divide and Approximate pruning technique can prune for non-monotone constraints but is limited to bottom-up single-group aggregation. We propose a solution that exhibits both efficiency in aggregation and generality and effectiveness in pruning for complex constraints. Our bounding techniques are as general as the Divide and Approximate pruning techniques for complex constraints and yet our multiway aggregation is as efficient as Star-cubing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The TPC-R benchmark, http://www.tpc.org/tpcr/
Beyer, Ramakrishnan: Bottom-up computation of sparse and Iceberg CUBE. In: SIGMOD 1999 (1999)
Agarwal, et al.: On the computation of multidimensional aggregates. VLDB 1996 (1996)
Dong, et al.: Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In: VLDB 2003 (2003)
Fang, et al.: Computing iceberg queries efficiently. In: VLDB 1998 (1998)
Gray, et al.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. J. Data Mining and Knowledge Discovery (1997)
Han, et al.: Efficient computation of iceberg cubes with complex measures. In: SIGMOD 2001 (2001)
Sarawagi, et al.: On computing the data cube. Tech. report, IBM Almaden Research Center (1996)
Wang, et al.: Pushing aggregate constraints by divide-and-approximate. In: ICDE 2002 (2002)
Zhao, et al.: An array-based algorithm for simultaneous multidimensional aggregates. In: SIGMOD 1997 (1997)
Ross, Srivastava: Fast computation of sparse datacubes. In: VLDB 1997 (1997)
Historical Census Projects. ftp://ftp.ipums.org/ipums/data/ip19001.Z, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chou, L.P., Zhang, X. (2004). Computing Complex Iceberg Cubes by Multiway Aggregation and Bounding. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30076-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22937-7
Online ISBN: 978-3-540-30076-2
eBook Packages: Springer Book Archive