Surety is performing system maintenance this weekend. Electronic date stamps on new Prior Art Database disclosures may be delayed.
Browse Prior Art Database

Variablise rule calculations

IP.com Disclosure Number: IPCOM000248175D
Publication Date: 2016-Nov-04
Document File: 6 page(s) / 166K

Publishing Venue

The IP.com Prior Art Database


Variablise Rule Calculations

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 43% of the total text.

Page 01 of 6

Variablise rule calculations

Abstract: An architecture to manage and easily control the target area of rules in an OLAP cube, using subsets for reduced maintainability and improved performance. Using this method, the users get to control the application of the business rules by updating the subset declared in the target area of the rule for the set of elements that qualifies various conditions. This eliminates the need to rely on developers/admins to write the advanced scripts and update it each time the condition changes.

A Subset is a list of customized dimension members created to facilitate improved operational performance. Subsets can greatly reduce the number of formulas that needs to be written, given that a formula can refer to a Subset rather than to the many individual constituent Members of a Dimension. Maintenance of Subsets is particularly useful when one is working with a very extensive list of Members-in order to organize a Slice, for example, one need only select the Subset of Members.

Field: The current solution pertains to system and method for optimizing and reducing the effort overhead involved in creating complex business rules calculations within an OLAP (Online Analytical Processing) tool by defining subsets and declaring it in the target area of a very sparse cube in IBM Cognos TM1, having significantly larger element set.

Background: While rules in TM1 are very flexible and provide the capability to build complex business calculations on the fly without the need to refresh it, it is relatively heavy on performance and can significantly impact the retrieval of data if not written in an optimized way.

The current mechanism of writing rules can easily lead the novice developers to write inefficient and broad rules applying the calculations where it is not required thereby adding additional performance overhead on the application.

Even if the rules are written most efficiently there is little room in the current architecture to reduce the scope of evaluation of the rule especially in a very sparse cube with higher dimensionality.

Additionally, the rules are not dynamic enough in nature to accommodate the changing requirements (conditions) and hence require the resources with specific skill set to update it manually, prone to errors.

Detailed Description: The detailed description consists of various sections including, detailing the summary of proposed solution, details of various components of the calculation statement, exemplary scenario, limitation of current approach, the new approach proposed and finally the a conclusion of detailed description.

Summary of proposed solution:

The proposed solution is targeted to minimize the effort in managing and writing the rules as well as reducing the performance hit, by improving the way subsets could be used in more ways than it is currently being utilized in TM1.


Page 02 of 6

Although TM1 rules makes some use of subsets concept to filter the dimension elements by...