Parallel data cube storage structure for range sum queries and dynamic updates
Journal of Computer Science and Technology
| Hi-index | 0.00 |
In the last years data warehousing has emerged as a fundamental database technology providing the basis for online analytical processing (OLAP). In general, analytical queries involve aggregations of large data sets. This results in serious performance problems if ad-hoc queries are to be answered on-line. One method to avoid performance bottlenecks is to use parallel hardware, i.e. SMP or MPP machines which are able to cope with the data volume. Another optimization approach specific to data warehousing is to preaggregate some of the results in order to avoid scanning the base relations. The prototypical OLAP system CubeStar Parallel Server combines both approaches. In order to achieve high query performance with low hardware costs we present a technique for the dynamic, i.e. query-behavior and load-dependent, use and management of multidimensional aggregates in a shared-nothing workstation cluster.