In TM1, if a TM1 Cube has huge of volume of data and rule calculation, there is possibility that TM1 takes longer time to open a cube view, to look at the issue with performance would be TM1 View Caches (Stargate Views).
With users unceasingly (almost perennially) demanding higher data upload speed and concurrent transfers, this blog offers insight and considerations one should keep in mind while simultaneously executing a Turbo Integrator (TI) process. It also highlights steps to avoid TI looping and/or thrashing.
While working for a particular client project, I was asked to review an existing long running Turbo Integrator (TI) process and find out ways to optimise its processing time, without compromising on the business functionality.
In this blog, would like to introduce you to a new feature called "Compare Sandboxes"; this feature, an extension to Planning Analytics Workspace’s existing capability, shall be available both on Cloud and in Local versions.
The last 3 weeks has been great in that it has showed an avenue that I had yet to explore in Planning Analytics, debugging.
Let me preface this blog by saying that my trip to India was so insightful, culturally rich and filled with great people that it was hands down the work trip of a life time.
Most who are still on Cognos Business Intelligence software version 10.2.x would know that the software version was due End of Service this April 2018. It was quite dreading for existing users who had not planned an upgrade to Cognos Analytics (or C11 as it is called within IBM) just yet as it wasn’t really a straight forward version upgrade but a complete overhaul in the way you would interact with Cognos BI; more intuitive, user friendly and insightful but requires a bit of learning and a little more unlearning.
In this blog, let me explain you about one of the hidden/unused feature from IBM Cognos TM1.
For starters, God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other combinatorial puzzles and mathematical games. It refers to any algorithm which produces a solution having the fewest possible moves, the idea being that an omniscient being would know an optimal step from any given configuration (source wiki).