Sciweavers

Share
DOLAP
2005
ACM

Parallel querying of ROLAP cubes in the presence of hierarchies

10 years 6 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimensional data model that offers an intuitive array-based perspective of the underlying data. Supporting efficient indexing facilities for multi-dimensional cube queries is an issue of some complexity. In practice, the difficulty of the indexing problem is exacerbated by the existence of attribute hierarchies that sub-divide attributes into aggregation layers of varying granularity. In this paper, we present a hierarchy and caching framework that supports the efficient and transparent manipulation of attribute hierarchies within a parallel ROLAP environment. Experimental results verify that, when compared to the non-hierarchical case, very little overhead is required to handle streams of arbitrary hierarchical queries. Categories and Subject Descriptors H.2.7.b [Database Management]: Data Warehouse and Repository; ...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl
Added 14 Oct 2010
Updated 14 Oct 2010
Type Conference
Year 2005
Where DOLAP
Authors Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
Comments (0)
books