Space-efficient data cubes for dynamic environments

Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi, Renato Pajarola

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

14 Citations (Scopus)

Abstract

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-the-y can result in non-interactive response times. To speed up range queries, values that summarize regions of the data cube are pre-computed and stored. This faster response time results in more expensive updates and/or space overhead. While the emphasis is typically on low query and update costs, growing data collections increase the demand for space-efficient approaches. In this paper two techniques are presented that have the same update and query costs as earlier approaches, without introducing any space overhead.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages24-33
Number of pages10
Volume1874
ISBN (Print)3540679804, 9783540679806
Publication statusPublished - 2000
Externally publishedYes
Event2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 - London, United Kingdom
Duration: 4 Sep 20006 Sep 2000

Publication series

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

Other

Other2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000
CountryUnited Kingdom
CityLondon
Period4/9/006/9/00

Fingerprint

Data Cube
Dynamic Environment
Range Query
Data warehouses
Update
Query
Response Time
Costs
Data Warehouse
Speedup
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Riedewald, M., Agrawal, D., El Abbadi, A., & Pajarola, R. (2000). Space-efficient data cubes for dynamic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1874, pp. 24-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1874). Springer Verlag.

Space-efficient data cubes for dynamic environments. / Riedewald, Mirek; Agrawal, Divyakant; El Abbadi, Amr; Pajarola, Renato.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1874 Springer Verlag, 2000. p. 24-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1874).

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

Riedewald, M, Agrawal, D, El Abbadi, A & Pajarola, R 2000, Space-efficient data cubes for dynamic environments. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1874, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1874, Springer Verlag, pp. 24-33, 2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000, London, United Kingdom, 4/9/00.
Riedewald M, Agrawal D, El Abbadi A, Pajarola R. Space-efficient data cubes for dynamic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1874. Springer Verlag. 2000. p. 24-33. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Riedewald, Mirek ; Agrawal, Divyakant ; El Abbadi, Amr ; Pajarola, Renato. / Space-efficient data cubes for dynamic environments. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1874 Springer Verlag, 2000. pp. 24-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{99d250b2e8b04f83a885a4f5db0b3fb5,
title = "Space-efficient data cubes for dynamic environments",
abstract = "Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-the-y can result in non-interactive response times. To speed up range queries, values that summarize regions of the data cube are pre-computed and stored. This faster response time results in more expensive updates and/or space overhead. While the emphasis is typically on low query and update costs, growing data collections increase the demand for space-efficient approaches. In this paper two techniques are presented that have the same update and query costs as earlier approaches, without introducing any space overhead.",
author = "Mirek Riedewald and Divyakant Agrawal and {El Abbadi}, Amr and Renato Pajarola",
year = "2000",
language = "English",
isbn = "3540679804",
volume = "1874",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "24--33",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Space-efficient data cubes for dynamic environments

AU - Riedewald, Mirek

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

AU - Pajarola, Renato

PY - 2000

Y1 - 2000

N2 - Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-the-y can result in non-interactive response times. To speed up range queries, values that summarize regions of the data cube are pre-computed and stored. This faster response time results in more expensive updates and/or space overhead. While the emphasis is typically on low query and update costs, growing data collections increase the demand for space-efficient approaches. In this paper two techniques are presented that have the same update and query costs as earlier approaches, without introducing any space overhead.

AB - Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-the-y can result in non-interactive response times. To speed up range queries, values that summarize regions of the data cube are pre-computed and stored. This faster response time results in more expensive updates and/or space overhead. While the emphasis is typically on low query and update costs, growing data collections increase the demand for space-efficient approaches. In this paper two techniques are presented that have the same update and query costs as earlier approaches, without introducing any space overhead.

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

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

M3 - Conference contribution

AN - SCOPUS:23044520639

SN - 3540679804

SN - 9783540679806

VL - 1874

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

SP - 24

EP - 33

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

PB - Springer Verlag

ER -