Applying OLAP Pre-Aggregation Techniques to ... - Jacobs University
Applying OLAP Pre-Aggregation Techniques to ... - Jacobs University
Applying OLAP Pre-Aggregation Techniques to ... - Jacobs University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
28 2. Background and Related Work<br />
aggregate queries [68]. One difficulty that M<strong>OLAP</strong> poses, however, pertains <strong>to</strong> the<br />
sparseness of the data. Sparseness means that many events did not take place and<br />
valuable processing time is taken by adding up zeros [91]. For example, a company<br />
may not sell every item every day in every s<strong>to</strong>re, so no values appear at the intersection<br />
where products are not sold in a particular region at a particular time. On the other<br />
hand, M<strong>OLAP</strong> can be much faster for applications where subsets of the data cube<br />
are dense [100]. Another limitation of this approach is that the computation of a<br />
cube requires a complex aggregate query across all data in a warehouse. Though<br />
it is possible <strong>to</strong> incrementally update cubes as new data arrives, it is impractical <strong>to</strong><br />
dynamically create new cubes <strong>to</strong> answer ad-hoc queries [68].<br />
Figure 2.10. M<strong>OLAP</strong> S<strong>to</strong>rage Scheme<br />
R<strong>OLAP</strong><br />
In R<strong>OLAP</strong>, underlying data is s<strong>to</strong>red in a relational database, see Fig. 2.11(a). The<br />
relational model, however, does not include concepts of dimension, measure, and hierarchy.<br />
Thus specific types of schemata must be created so the multidimensional<br />
model can be represented in terms of basic relational elements such as attributes, relations,<br />
and integrity constraints [68]. Such representations are done using a star schema<br />
data model, although the snowflake schema is also often adopted.<br />
R<strong>OLAP</strong> implementations can handle large amounts of data and leverage all functionalities<br />
of the relational database [72]. Disadvantages are that overall performance<br />
is slow and each R<strong>OLAP</strong> report represents an SQL query with the limitations of the<br />
genre. R<strong>OLAP</strong> vendors tried <strong>to</strong> mitigate this problem by including out-of-the-box<br />
complex functions in their product offering and providing users the capability of defining<br />
their own functions. Another problem with R<strong>OLAP</strong> implementations results from<br />
the performance hit caused by costly join operations between large tables [68]. To<br />
overcome this issue, fact tables in data-warehouses are usually de-normalized. Sub-