BW-IP Custom logic before save

[Former Member]

Hi Experts

In BW-IP do we have any option to change the data before its saved in the cube. Like we do it in BPC in UJR_WRITE_BACK BADI.

The requirement is that user should be able to save at the non-leaf node of the hierarchy. And the logic should be implemented that the difference between what user enters and sum of all child nodes below should be saved on dummy node created for non leaf node.

[gregor_dieckmann · Accepted solution]

Hi Anurag,

yes, one can call a planning function 'before save', you find this option in transaction RSPLAN: enter the base InfoProvider (e.g. InfoCube or DSO), press button 'InfoProvider', and go to tab 'Central Settings'.

But planning function work on flat data records, values from hierarchy nodes are not exposed there.

It seems that you come from BPC Standard: you should be aware that BPC Standard and BPC Embedded handle hierarchies in a different way.

BPC Standard: Hierarchy

4711          inner hierarchy node    

     4712     leaf    

     4712     leaf

In BW and thus in BPC Embedded the hierarchy looks like this

4711          inner hierarchy node  (called postable node)

     4711     leaf  

     4712     leaf    

     4712     leaf

BPC Standard hides the leaf 4711 and identifies this leaf with the inner node 4711. In BW node values will not be stored only leaf value, i.e. 4711 in the role of the leaf may have values in the fact table.

As I mentioned, in planning functions 4711 in the role of the inner hierarchy node will not be exposed, so it is hard to implement what you want using planning function.

On the other hand, I wonder why you want this kind of logic. The usual approach is to use disaggregation in the query, i.e. hierarchy node can be input ready, changes will be disaggregated. Why do you want to post the changes on the hierarchy node (delta) on a dummy node?

In the above example 'delta disaggregation' would do the job if you fix leaves 4712, 4713 and change the value on the hierarchy node 4711.

Regards,

Gregor

[Former Member · Accepted solution]

Hi Gregor

Can you explain bit more about 'delta disaggregation' ?

Also not sure how you suggest to fix the leaves 4712 and 4713 as the hierarchy is dynamic and has many levels. And in some cases 4712 and 4713 will also have child nodes.

Thus in my case we tried with the following options

1)  Disaggregation - Disaggregate difference to value entered ( This is fine with us)

2) Type of distribution - Equal distribution ( This is a problem, other options are also not as per requirment)

The Equal distribution is a problem, as we want to copy the entire difference amount to 4711(leaf )node.

Please suggest.