Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes

S. Geffner, D. Agrawal, A. El Abbadi, T. Smith

Research output: Chapter in Book/Report/Conference proceedingChapter

71 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) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or 'near-current'. Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Place of PublicationLos Alamitos, CA, United States
PublisherInstitute of Electrical and Electronics Engineers Computer Society
Pages328-335
Number of pages8
Publication statusPublished - 1 Jan 1999
Externally publishedYes
EventProceedings of the 1999 15th International Conference on Data Engineering, ICDE-99 - Sydney, NSW, AUS
Duration: 23 Mar 199926 Mar 1999

Other

OtherProceedings of the 1999 15th International Conference on Data Engineering, ICDE-99
CitySydney, NSW, AUS
Period23/3/9926/3/99

Fingerprint

Costs
Agglomeration

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Geffner, S., Agrawal, D., El Abbadi, A., & Smith, T. (1999). Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. In Proceedings - International Conference on Data Engineering (pp. 328-335). Los Alamitos, CA, United States: Institute of Electrical and Electronics Engineers Computer Society.

Relative prefix sums : an efficient approach for querying dynamic OLAP data cubes. / Geffner, S.; Agrawal, D.; El Abbadi, A.; Smith, T.

Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States : Institute of Electrical and Electronics Engineers Computer Society, 1999. p. 328-335.

Research output: Chapter in Book/Report/Conference proceedingChapter

Geffner, S, Agrawal, D, El Abbadi, A & Smith, T 1999, Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. in Proceedings - International Conference on Data Engineering. Institute of Electrical and Electronics Engineers Computer Society, Los Alamitos, CA, United States, pp. 328-335, Proceedings of the 1999 15th International Conference on Data Engineering, ICDE-99, Sydney, NSW, AUS, 23/3/99.
Geffner S, Agrawal D, El Abbadi A, Smith T. Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. In Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States: Institute of Electrical and Electronics Engineers Computer Society. 1999. p. 328-335
Geffner, S. ; Agrawal, D. ; El Abbadi, A. ; Smith, T. / Relative prefix sums : an efficient approach for querying dynamic OLAP data cubes. Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States : Institute of Electrical and Electronics Engineers Computer Society, 1999. pp. 328-335
@inbook{21af71235c9940c2b76ca76f5cc145d0,
title = "Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes",
abstract = "Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or 'near-current'. Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.",
author = "S. Geffner and D. Agrawal and {El Abbadi}, A. and T. Smith",
year = "1999",
month = "1",
day = "1",
language = "English",
pages = "328--335",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "Institute of Electrical and Electronics Engineers Computer Society",

}

TY - CHAP

T1 - Relative prefix sums

T2 - an efficient approach for querying dynamic OLAP data cubes

AU - Geffner, S.

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Smith, T.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or 'near-current'. Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.

AB - Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or 'near-current'. Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.

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

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

M3 - Chapter

AN - SCOPUS:0032637610

SP - 328

EP - 335

BT - Proceedings - International Conference on Data Engineering

PB - Institute of Electrical and Electronics Engineers Computer Society

CY - Los Alamitos, CA, United States

ER -