By Topic

Computing cube view dependences in OLAP datacubes

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
$31 $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

2 Author(s)
Hurtado, C. ; Dept. of Comput. Sci., Univ. de Chile, Chile ; Gutierrez, C.

A common technique for speeding up OLAP query processing is to materialize (pre-compute) some aggregate views, called cube views, and use them for the derivation of other cube views. The derivations are inferred from the dimension hierarchies, and are usually represented as a relation between cube views called cube dependence relation, also called summarizability relation for a single dimension hierarchy. In this paper, we study the problem of computing the summarizability relation of dimension schemas that model structural irregularities of dimensions by means of integrity constraints. We study the intrinsic complexity of the problem, and present an algorithm, which uses deep structural properties of dimension hierarchies and constraints to solve the problem. Finally, we give an extension of the algorithm to compute the dependence relation for the multidimensional case.

Published in:

Scientific and Statistical Database Management, 2003. 15th International Conference on

Date of Conference:

9-11 July 2003