Cubetree: Organization of and bulk incremental updates on the data cube (1997)
| Venue: | Proceedings of the 1997 ACM SIGMOD Conference |
| Citations: | 30 - 5 self |
BibTeX
@INPROCEEDINGS{Roussopoulos97cubetree:organization,
author = {Nick Roussopoulos},
title = {Cubetree: Organization of and bulk incremental updates on the data cube},
booktitle = {Proceedings of the 1997 ACM SIGMOD Conference},
year = {1997},
pages = {89--99}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The data cube is an aggregate operator which has been shown to be very powerful for On Line Analytical Processing (OLAP) in the context of data warehousing. It is, however, very expensive to compute, access, and maintain. In this paper we de ne the \cubetree " as a storage abstraction of the cube and realize it using packed R-trees for most e-cient cube queries. We then reduce the problem of creation and maintenance of the cube to sorting and bulk incremental merge-packing of cubetrees. This merge-pack has been implemented to use separate storage for writing the updated cubetrees, therefore allowing cube queries to continue even during maintenance. Finally, wecharacterize the size of the delta increment for achieving good bulk update schedules for the cube. The paper includes experiments with various data sets measuring query and bulk update performance. 1
