Flexible data cubes for online aggregation

Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Citations (Scopus)

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 dificult 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 spaceoptimal 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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages159-173
Number of pages15
Volume1973
ISBN (Print)9783540414568
Publication statusPublished - 2001
Externally publishedYes
Event8th International Conference on Database Theory, ICDT 2001 - London, United Kingdom
Duration: 4 Jan 20016 Jan 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1973
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Conference on Database Theory, ICDT 2001
CountryUnited Kingdom
CityLondon
Period4/1/016/1/01

Fingerprint

Data Cube
Aggregation
Agglomeration
Processing
Online Analytical Processing
Range Query
Costs
High-dimensional Data
Dimensionality
Correctness
Speedup
High-dimensional
Trade-offs
Configuration
Requirements

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Riedewald, M., Agrawal, D., & Abbadi, A. E. (2001). Flexible data cubes for online aggregation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1973, pp. 159-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1973). Springer Verlag.

Flexible data cubes for online aggregation. / Riedewald, Mirek; Agrawal, Divyakant; Abbadi, Amr El.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1973 Springer Verlag, 2001. p. 159-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1973).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Riedewald, M, Agrawal, D & Abbadi, AE 2001, Flexible data cubes for online aggregation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1973, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1973, Springer Verlag, pp. 159-173, 8th International Conference on Database Theory, ICDT 2001, London, United Kingdom, 4/1/01.
Riedewald M, Agrawal D, Abbadi AE. Flexible data cubes for online aggregation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1973. Springer Verlag. 2001. p. 159-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Riedewald, Mirek ; Agrawal, Divyakant ; Abbadi, Amr El. / Flexible data cubes for online aggregation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1973 Springer Verlag, 2001. pp. 159-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{33ed08eb94cf4afabc5e1d4c580927dd,
title = "Flexible data cubes for online aggregation",
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 dificult 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 spaceoptimal 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.",
author = "Mirek Riedewald and Divyakant Agrawal and Abbadi, {Amr El}",
year = "2001",
language = "English",
isbn = "9783540414568",
volume = "1973",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "159--173",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Flexible data cubes for online aggregation

AU - Riedewald, Mirek

AU - Agrawal, Divyakant

AU - Abbadi, Amr El

PY - 2001

Y1 - 2001

N2 - 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 dificult 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 spaceoptimal 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.

AB - 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 dificult 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 spaceoptimal 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.

UR - http://www.scopus.com/inward/record.url?scp=84949469125&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949469125&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540414568

VL - 1973

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 159

EP - 173

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -