Authors: Bart Kuijpers, Jan Paredaens, Jef Wijsen, Stijn Dekeyser
Tags: 1998, conceptual modeling
Nested data cubes (NDCs in short) are a generalization of other OLAP models such as f-tables [4] and hypercubes [2], but also of classical structures as sets, bags, and relations. This model adds to the previous models flexibility in viewing the data, in that it allows for the assignment of priorities to the different dimensions of the multidimensional OLAP data. We also present an algebra in which most typical OLAP analysis and navigation operations can be formulated. We present a number of algebraic operators that work on nested data cubes and that preserve the functional dependency between the dimensional coordinates of the data cube and the factual data in it. We show how these operations can be applied to sub-NDCs at any depth, and also show that the NDC algebra can express the SPJR algebra [1] of the relational model. Importantly, we show that the NDC algebra primitives can be implemented by linear time algorithms.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-540-49121-7_11
