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 language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 24-33 |
| Number of pages | 10 |
| Volume | 1874 |
| ISBN (Print) | 3540679804, 9783540679806 |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | 2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 - London, United Kingdom Duration: 4 Sep 2000 → 6 Sep 2000 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1874 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 |
|---|---|
| Country | United Kingdom |
| City | London |
| Period | 4/9/00 → 6/9/00 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
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 proceeding › Conference contribution
}
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 -