Lazy aggregates for real-time OLAP

Jukka Kiviniemi; Antoni Wolski; Antti Pesonen; Johannes Arminen

doi:10.1007/3-540-48298-9_18

Lazy aggregates for real-time OLAP

Jukka Kiviniemi, Antoni Wolski, Antti Pesonen, Johannes Arminen

VTT (former employee or external)

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-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 language	English
Title of host publication	DataWarehousing and Knowledge Discovery
Subtitle of host publication	First International Conference, DaWaK’99 Proceedings
Publisher	Springer
Pages	165-172
ISBN (Electronic)	978-3-540-48298-7
ISBN (Print)	978-3-540-66458-1
DOIs	https://doi.org/10.1007/3-540-48298-9_18
Publication status	Published - 1999
MoE publication type	A4 Article in a conference publication
Event	1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99 - Florence, Italy Duration: 30 Aug 1999 → 1 Sept 1999

Publication series

Series	Lecture Notes in Computer Science
Volume	1676
ISSN	0302-9743

Conference

Conference	1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99
Country/Territory	Italy
City	Florence
Period	30/08/99 → 1/09/99

Keywords

database management
information retrieval

Access to Document

10.1007/3-540-48298-9_18

Cite this

@inproceedings{de3aa9e135be455dbfbd943a37e34d93,

title = "Lazy aggregates for real-time OLAP",

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.",

keywords = "database management, information retrieval",

author = "Jukka Kiviniemi and Antoni Wolski and Antti Pesonen and Johannes Arminen",

year = "1999",

doi = "10.1007/3-540-48298-9\_18",

language = "English",

isbn = "978-3-540-66458-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "165--172",

booktitle = "DataWarehousing and Knowledge Discovery",

address = "Germany",

note = "1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99 ; Conference date: 30-08-1999 Through 01-09-1999",

}

Kiviniemi, J, Wolski, A, Pesonen, A & Arminen, J 1999, Lazy aggregates for real-time OLAP. in DataWarehousing and Knowledge Discovery: First International Conference, DaWaK’99 Proceedings. Springer, Lecture Notes in Computer Science, vol. 1676, pp. 165-172, 1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99, Florence, Italy, 30/08/99. https://doi.org/10.1007/3-540-48298-9_18

Lazy aggregates for real-time OLAP. / Kiviniemi, Jukka; Wolski, Antoni; Pesonen, Antti et al.
DataWarehousing and Knowledge Discovery: First International Conference, DaWaK’99 Proceedings. Springer, 1999. p. 165-172 (Lecture Notes in Computer Science, Vol. 1676).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Lazy aggregates for real-time OLAP

AU - Kiviniemi, Jukka

AU - Wolski, Antoni

AU - Pesonen, Antti

AU - Arminen, Johannes

PY - 1999

Y1 - 1999

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

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

KW - database management

KW - information retrieval

U2 - 10.1007/3-540-48298-9_18

DO - 10.1007/3-540-48298-9_18

M3 - Conference article in proceedings

SN - 978-3-540-66458-1

T3 - Lecture Notes in Computer Science

SP - 165

EP - 172

BT - DataWarehousing and Knowledge Discovery

PB - Springer

T2 - 1st International Conference on Data Warehousing and Knowledge Discovery, DaWak'99

Y2 - 30 August 1999 through 1 September 1999

ER -

Lazy aggregates for real-time OLAP

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this