Optimizer on rearranging Applies To for optimal performance
In our current models we have been struggling with performance.
1 big impact is the arranging of applies to.
It would be great if we have an optimizer that could determine the optimal Applies to for the performance of a given model. This is based a certain constraints from what i understand
1: Size of given list
2: Arrange largest lists to smallest lists
3: Use of lists. If a product & time hierarchy is used most of the time this should always be the first to be organized
Actually, ideally, this should happen in the background - The engine should determine the optimal order and the user need not worry about it
I would also add that largest to smallest is not definitive; consistency yes, but the size of the list gets more complicated; it depends of the sparsity of the data
Status changed to: New0
Get Started with Idea Exchange
See our Submission Guidelines and Idea Evaluation Criteria, then start posting your own ideas and showing support for others!