This article addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present RCUBE, a distributed multidimensional ROLAP indexing scheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, and number of processors. Our method is also incrementally maintainable. Using "surrogate" group-bys, it allows for the efficient processing of arbitrary OLAP queries on partial cubes, where not all of the group-bys have been materialized. Our experiments with RCUBE show that the ROLAP advantage of better scalability, in comparison to MOLAP, can be maintained while providing a fast and flexible index for OLAP queries. Copyright

Additional Metadata
Keywords Algorithmic complexity, Data warehousing and OLAP, Datacube, Efficiency, High performance computing, Parallel ROLAP indexing, Scalability issues, Scalability to large databases
Journal International Journal of Data Warehousing and Mining
Citation
Dehne, F, Eavis, T. (Todd), & Rau-Chaplin, A. (Andrew). (2008). RCUBE: Parallel multi-dimensional ROLAP indexing. International Journal of Data Warehousing and Mining, 4(3), 1–14.