By Topic

Top-down computation of partial ROLAP data cubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
F. Dehne ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; T. Eavis ; A. Rau-Chaplin

The precomputation of the different summary views of a data cube is critical to improving the response time of data cube queries for online analytical processing (OLAP). The computation of the full data cube, representing all 2d views, has been studied extensively. However, the full cube is often too large to be computed and stored, and for some applications all views are not even required. Hence, it is important to provide efficient methods for the computation of partial data cubes consisting of an arbitrary, user selected, subset of the 2d possible views. In this paper, we study the top-down computation of partial ROLAP data cubes. We present both sequential and parallel methods for top-down partial data cube construction. Our experimental results indicate close to linear performance improvement for partial data cube computation. For example, when selecting 50% of the views our method requires only 55% of the time required to build the full cube, and when selecting 75% of the views our method requires just 82% of the full cube time.

Published in:

System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on

Date of Conference:

5-8 Jan. 2004