240 • Developing Essbase Applications: Advanced Techniques for Finance and IT Professionals
Or, using non-recursive notation:
# bits per sibling family ≡
i=level–0
level–max
∑
Log SiblingCount(l(i))
and nd the maximum number of bits over all sets of sibling families.
# bits per Stored hierarchy ≡ max(# bits per sibling family)
[DBAG 1]
is maximum will be the number of bits required for the Stored hierarchy, where:
• Parents with only one child are eectively ignored in the bitmap and level
count
[DBAG 6]
because Log(1) = 0. is behavior is not related to the “Never Share”
tag and appears to be unaected by this tag.
• level-max above is the highest level that is not tagged “Label Only”
[DBAG 2]
. e
sentence from the DBAG above: “erefore, if t ...