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

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

Research output: Contribution to conferencePaper

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
Pages328-335
Number of pages8
Publication statusPublished - 1 Jan 1999
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

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Geffner, S., Agrawal, D., El Abbadi, A., & Smith, T. (1999). Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. 328-335. Paper presented at Proceedings of the 1999 15th International Conference on Data Engineering, ICDE-99, Sydney, NSW, AUS, .