Article

Flexible Data Cubes for Online Aggregation

Authors:

Mirek Riedewald,

Divyakant Agrawal,

Amr El AbbadiAuthors Info & Claims

ICDT '01: Proceedings of the 8th International Conference on Database Theory

Pages 159 - 173

Published: 04 January 2001 Publication History

Abstract

Applications like Online Analytical Processing depend heavily on the ability to quickly summarize large amounts of information. Techniques were proposed recently that speed up aggregate range queries on MOLAP data cubes by storing pre-computed aggregates. These approaches try to handle data cubes of any dimensionality by dealing with all dimensions at the same time and treat the different dimensions uniformly. The algorithms are typically complex, and it is difficult to prove their correctness and to analyze their performance. We present a new technique to generate Iterative Data Cubes (IDC) that addresses these problems. The proposed approach provides a modular framework for combining one-dimensional aggregation techniques to create space-optimal high-dimensional data cubes. A large variety of cost tradeoffs for high-dimensional IDC can be generated, making it easy to find the right configuration based on the application requirements.

References

[1]

E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 156-165, 1997.

[2]

K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg CUBEs. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 359-370, 1999.

[3]

C.-Y. Chan and Y. E. Ioannidis. Hierarchical cubes for range-sum queries. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 675-686, 1999. Extended version published as Tech. Report, Univ. of Wisconsin, 1999.

[4]

E. F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate. Technical report, E. F. Codd and Associates, 1993.

[5]

S. Geffner, D. Agrawal, and A. El Abbadi. The dynamic data cube. In Proc. Int. Conf. on Extending Database Technology (EDBT), pages 237-253, 2000.

[6]

S. Geffner, D. Agrawal, A. El Abbadi, and T. Smith. Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. In Proc. Int. Conf. on Data Engineering (ICDE), pages 328-335, 1999.

[7]

J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery, pages 29-53, 1997.

[8]

H. Gupta. Selection of views to materialize in a data warehouse. In Proc. Int. Conf. on Database Theory (ICDT), pages 98-112, 1997.

[9]

H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index selection for OLAP. In Proc. Int. Conf. on Data Engineering (ICDE), pages 208-219, 1997.

[10]

V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 205- 216, 1996.

[11]

C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 73-88, 1997.

[12]

T. Johnson and D. Shasha. Some approaches to index design for cube forests. IEEE Data Engineering Bulletin, 20(1):27-35, 1997.

[13]

Y. Kotidis and N. Roussopoulos. An alternative storage organization for ROLAP aggregate views based on cubetrees. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 249-258, 1998.

[14]

N. Pendse and R. Creeth. The OLAP report. http://www.olapreport.com/Analyses.htm, 2000. Parts available online in the current edition.

[15]

M. Riedewald, D. Agrawal, and A. El Abbadi. Flexible data cubes for online aggregation. Technical report, UC Santa Barbara, 2000.

[16]

M. Riedewald, D. Agrawal, and A. El Abbadi. pCube: Update-efficient online aggregation with progressive feedback and error bounds. In Proc. Int. Conf. on Scientific and Statistical Database Management (SSDBM), pages 95-108, 2000.

[17]

M. Riedewald, D. Agrawal, A. El Abbadi, and R. Pajarola. Space-efficient data cubes for dynamic environments. In Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK), pages 24-33, 2000.

[18]

J. R. Smith, V. Castelli, A. Jhingran, and C.-S. Li. Dynamic assembly of views in data cubes. In Proc. Symp. on Principles of Database Systems (PODS), pages 274-283, 1998.

[19]

Transaction Processing Performance Council. TPC-H benchmark (1.1.0). Available at http://www.tpc.org.

[20]

J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 193-204, 1999.

[21]

J. S. Vitter, M. Wang, and B. Iyer. Data cube approximation and histograms via wavelets. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), pages 96-104, 1998.

Cited By

Daghistani AAref WGhafoor AMahmood A(2021)SWARM: Adaptive Load Balancing in Distributed Streaming Systems for Big Spatial DataACM Transactions on Spatial Algorithms and Systems10.1145/34600137:3(1-43)Online publication date: 8-Jun-2021
https://dl.acm.org/doi/10.1145/3460013
Daghistani AAref WGhafoor A(2020)TrioStatProceedings of the 28th International Conference on Advances in Geographic Information Systems10.1145/3397536.3422220(78-86)Online publication date: 3-Nov-2020
https://dl.acm.org/doi/10.1145/3397536.3422220
Lin QKe WLou JZhang HSui KXu YZhou ZQiao BZhang DGuo YFarooq F(2018)BigIN4Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3219819.3219867(547-555)Online publication date: 19-Jul-2018
https://dl.acm.org/doi/10.1145/3219819.3219867
Show More Cited By

Recommendations

The Mobius Cubes
A flexible aggregation framework on large-scale heterogeneous information networks

OLAP On-line Analytical Processing can provide users with aggregate results from different perspectives and granularities. With the advent of heterogeneous information networks that consist of multi-type, interconnected nodes, such as bibliographic ...
Efficient incremental maintenance of data cubes
VLDB '06: Proceedings of the 32nd international conference on Very large data bases

The data cube provides users with aggregated results that are group-bys for all possible combinations of dimension attributes. When the number of dimension attributes is n, the data cube computes 2ⁿ group-bys, each of which is called a cuboid. A data ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICDT '01: Proceedings of the 8th International Conference on Database Theory

January 2001

449 pages

ISBN:3540414568

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 04 January 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Daghistani AAref WGhafoor AMahmood A(2021)SWARM: Adaptive Load Balancing in Distributed Streaming Systems for Big Spatial DataACM Transactions on Spatial Algorithms and Systems10.1145/34600137:3(1-43)Online publication date: 8-Jun-2021
https://dl.acm.org/doi/10.1145/3460013
Daghistani AAref WGhafoor A(2020)TrioStatProceedings of the 28th International Conference on Advances in Geographic Information Systems10.1145/3397536.3422220(78-86)Online publication date: 3-Nov-2020
https://dl.acm.org/doi/10.1145/3397536.3422220
Lin QKe WLou JZhang HSui KXu YZhou ZQiao BZhang DGuo YFarooq F(2018)BigIN4Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3219819.3219867(547-555)Online publication date: 19-Jul-2018
https://dl.acm.org/doi/10.1145/3219819.3219867
Aly AMahmood AHassan MAref WOuzzani MElmeleegy HQadah T(2015)AQWAProceedings of the VLDB Endowment10.14778/2831360.28313618:13(2062-2073)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.14778/2831360.2831361
Haddadin KLauer T(2010)Efficient online aggregates in dense-region-based data cube representationsTransactions on large-scale data- and knowledge-centered systems II10.5555/1986668.1986672(73-102)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1986668.1986672
Haddadin KLauer T(2010)Efficient online aggregates in dense-region-based data cube representationsTransactions on large-scale data- and knowledge-centered systems II10.5555/1980651.1980655(73-102)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1980651.1980655
Wu SOoi BTan KElmagarmid AAgrawal D(2010)Continuous sampling for online aggregation over multiple queriesProceedings of the 2010 ACM SIGMOD International Conference on Management of data10.1145/1807167.1807238(651-662)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1145/1807167.1807238
Jin DTsuji TTsuchida THiguchi K(2008)An incremental maintenance scheme of data cubesProceedings of the 13th international conference on Database systems for advanced applications10.5555/1802514.1802534(172-187)Online publication date: 19-Mar-2008
https://dl.acm.org/doi/10.5555/1802514.1802534
Bengtsson FChen J(2004)Efficient algorithms for k maximum sumsProceedings of the 15th international conference on Algorithms and Computation10.1007/978-3-540-30551-4_14(137-148)Online publication date: 20-Dec-2004
https://dl.acm.org/doi/10.1007/978-3-540-30551-4_14
Riedewald MAgrawal DAbbadi A(2003)Dynamic multidimensional data cubesMultidimensional databases10.5555/887433.887442(200-221)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.5555/887433.887442
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents