Browse Prior Art Database

Method to Resolve Complex Relationships Between Data Elements Contained in Configuration Items to Build a Service Hierarchy

IP.com Disclosure Number: IPCOM000236343D
Publication Date: 2014-Apr-21
Document File: 5 page(s) / 98K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a specific method to resolve the recursive look-up logic and complex relationship among the moving data within a Connected Graph Data Structure used in the Extract Transform Loading (ETL) industry.

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

Page 01 of 5

Method to Resolve Complex Relationships Between Data Elements Contained in Configuration Items to Build a Service Hierarchy

The need to resolve recursive logic has dramatically increased in the current (ETL) Extract Transform Loading Industry. Because ETL normally is a row-based operation, resolving the complex relationship logic within the moving data is difficult. At the same time, however, the business need to resolve complex logic is increasing.

For example, there is a business need to report the configuration impacts about information technology (IT) assets. When one IT asset has a configuration change, the single change can have a chain impact to other related assets. If administrators upgrade an application from Version 8 to Version 9, it is one configuration change. However, that single upgrade impacts related database (DB) applications and enterprise applications. Then, the change on the database application might in turn need to upgrade the operating system library. If an administrator is reporting a change on database application, then all the related impacts, including upstream to the cause and the downstream results must also be reported.

To resolve such a complex relationship, the data source must be recursively looked up. This current solution has several drawbacks. When performing the recursive look-up, frequent visits to the DB source consume a large amount of time and resources. In addition, the responding time is slow.

Another drawback is the difficulty in resolving the logic because during the recursive look-up, an infinite loop can happen. For example, an enterprise application can cause a database change, and then cause an operating system change, and then, finally the operating system change causes another enterprise application change. To reflect this business logic, an infinite loop might happen.

The novel solution is a specific method to resolve the recursive look-up logic and complex relationship among the moving data within a Connected Graph Data Structure. The Graph Data Structure built for this solution has two directions, upstream and downstream. The method is to s...