The dynamic data cube

Steven Geffner, Divakant Agrawal, Amr El Abbadi

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

33 Citations (Scopus)

Abstract

Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. We present the Dynamic Data Cube, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages237-253
Number of pages17
Volume1777
ISBN (Print)3540672273, 9783540672272
Publication statusPublished - 2000
Externally publishedYes
Event7th International Conference on Extending Database Technology, EDBT 2000 - Konstanz, Germany
Duration: 27 Mar 200031 Mar 2000

Publication series

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

Other

Other7th International Conference on Extending Database Technology, EDBT 2000
CountryGermany
CityKonstanz
Period27/3/0031/3/00

Fingerprint

Data Cube
Query
Range of data
Agglomeration
Clustered Data
Sparse Data
Numerics
Aggregation
Update
Cell

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Geffner, S., Agrawal, D., & El Abbadi, A. (2000). The dynamic data cube. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1777, pp. 237-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1777). Springer Verlag.

The dynamic data cube. / Geffner, Steven; Agrawal, Divakant; El Abbadi, Amr.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1777 Springer Verlag, 2000. p. 237-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1777).

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

Geffner, S, Agrawal, D & El Abbadi, A 2000, The dynamic data cube. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1777, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1777, Springer Verlag, pp. 237-253, 7th International Conference on Extending Database Technology, EDBT 2000, Konstanz, Germany, 27/3/00.
Geffner S, Agrawal D, El Abbadi A. The dynamic data cube. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1777. Springer Verlag. 2000. p. 237-253. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Geffner, Steven ; Agrawal, Divakant ; El Abbadi, Amr. / The dynamic data cube. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1777 Springer Verlag, 2000. pp. 237-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a131358018d145168e7f2ee94a19c2b8,
title = "The dynamic data cube",
abstract = "Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. We present the Dynamic Data Cube, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.",
author = "Steven Geffner and Divakant Agrawal and {El Abbadi}, Amr",
year = "2000",
language = "English",
isbn = "3540672273",
volume = "1777",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "237--253",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - The dynamic data cube

AU - Geffner, Steven

AU - Agrawal, Divakant

AU - El Abbadi, Amr

PY - 2000

Y1 - 2000

N2 - Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. We present the Dynamic Data Cube, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.

AB - Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. We present the Dynamic Data Cube, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.

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

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

M3 - Conference contribution

AN - SCOPUS:84937435270

SN - 3540672273

SN - 9783540672272

VL - 1777

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

SP - 237

EP - 253

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

PB - Springer Verlag

ER -