|
Published Articles >> Table of Contents >> Abstract
15th International Conference on Scientific and Statistical Database Management
p. 33
Computing Cube View Dependences in OLAP Datacubes
Carlos Hurtado, Universidad de Chile
Claudio Gutierrez, Universidad de Chile
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SSDM.2003.1214950
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Citation:
Carlos Hurtado, Claudio Gutierrez,
"Computing Cube View Dependences in OLAP Datacubes,"
ssdbm,
p. 33,
15th International Conference on Scientific and Statistical Database Management,
2003
|
|
