File Library

NOTE THIS IS the same presentation I gave in 2013 - I could give it as - is or add some new topics - it is rather "Full" as it is however. Even if I gave it "AsIs" again I might go into some topics more slowly and cut some out. It really almost needs to be 2 sessions based on the reviews (4.46 rating)

Why are some cubes fast and some slow? When is it OK to use MDX and when should (or what types of) MDX be avoided? How do Solve Order, Dynamic and Stored Hierarchies interact? When should you depend on aggregation for speed and how can you design to avoid long aggregation runs?

By understanding how Essbase goes about resolving a query, many of these questions will answer themselves. Much of this understanding comes from the cryptic Bitmap Statistics dialog in Cube Properties. Now that definitive explanations of the bitmap statistics have been included in the v11.2 documentation, how do they work and what are the implications on performance and cube design?

In particular, there are implications and options for the design of alternative hierarchies. These options will be discussed in terms of the trade-offs of cost (in storage size) vs. performance (in retrieval time). Concrete examples will be demonstrated.