Lazy aggregates for real-time OLAP

Jukka Kiviniemi, Antoni Wolski, Antti Pesonen, Johannes Arminen

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

5 Citations (Scopus)

Abstract

In OLAP models, or data cubes, aggregates have to be recalculated when the underlying base data changes. This may cause, performance problems in real-time OLAP systems which continuously accommodate huge amounts of measurement data. To optimize the aggregate computations, a new consistency criterion called the tolerance invariant is proposed. Lazy aggregates are aggregates that are recalculated only when the tolerance invariant is violated, i.e., the error of the previously calculated aggregate exceeds the given tolerance. An industrial case study is presented. Thee prototype implementation is described, together with the performance results.
Original languageEnglish
Title of host publicationDataWarehousing and Knowledge Discovery
Subtitle of host publicationFirst International Conference, DaWaK’99 Proceedings
PublisherSpringer
Pages165-172
ISBN (Electronic)978-3-540-48298-7
ISBN (Print)978-3-540-66458-1
DOIs
Publication statusPublished - 1999
MoE publication typeA4 Article in a conference publication
Event1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99 - Florence, Italy
Duration: 30 Aug 19991 Sep 1999

Publication series

SeriesLecture Notes in Computer Science
Volume1676
ISSN0302-9743

Conference

Conference1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99
CountryItaly
CityFlorence
Period30/08/991/09/99

Keywords

  • database management
  • information retrieval

Fingerprint Dive into the research topics of 'Lazy aggregates for real-time OLAP'. Together they form a unique fingerprint.

Cite this