Hierarchical Transaction Tree for Abnormal Loop Detection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In computing systems, identifying and addressing performance degradation issues caused by infinite or endless loops of transactions is challenging, requiring labor-intensive monitoring and manual analysis.

Innovation Solution

A hierarchical transaction tree is used to organize transactions, allowing for automatic detection of abnormalities based on tree size and depth level, with alerts generated to pinpoint potential root causes of performance degradation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If manual monitoring and analysis is used to identify performance degradation, then detection accuracy is improved, but labor intensity and time consumption increase

Engineering Contradiction:
Improvedetection accuracyVSAvoidtime consumption
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The system performs self-diagnosis by automatically detecting abnormal transaction loops through hierarchical tree analysis of transaction data, eliminating the need for manual monitoring while maintaining high detection accuracy through automated anomaly detection algorithms

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent replaces manual mechanical analysis with automated computational analysis by constructing hierarchical transaction trees and using algorithms to detect abnormal loops, substituting human labor with machine-based automated detection systems

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Speed

If continuous monitoring is implemented to quickly identify performance issues, then response time is improved, but system complexity and resource consumption increase

Engineering Contradiction:
Improveresponse timeVSAvoidsystem complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent segments the monitoring system into hierarchical transaction trees that organize transactions by depth levels and parent-child relationships, allowing focused analysis of specific transaction paths rather than monitoring all transactions uniformly, thus reducing overall system complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system applies different monitoring intensities to different transaction paths by identifying abnormal loops locally within the hierarchical tree structure, concentrating computational resources on problematic areas rather than uniformly monitoring all transactions

Inventive Principle:
Principle #3Local quality

3Measurement precision

If manual analysis is used to pinpoint root causes, then analysis depth is improved, but productivity decreases

Engineering Contradiction:
Improveanalysis depthVSAvoidresolution speed
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The system performs preliminary organization of transaction data into hierarchical trees with identified parent-child relationships and depth levels before analysis, pre-structuring the data to enable rapid root cause identification without requiring time-consuming manual exploration

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements automated feedback mechanisms that detect abnormal transaction loops and immediately provide root cause information, creating a closed-loop system that continuously monitors and self-corrects without manual intervention, thereby increasing resolution speed

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS12204526B2Detection of abnormal transaction loops
Publication Date: 2025.01.21 MICRO FOCUS LLC
  • US12204526B2 patent drawing
  • US12204526B2 patent drawing
  • US12204526B2 patent drawing

AI summary

Examples relate to detecting an abnormality. The examples disclosed herein enable receiving, from a first user, a first request to perform a first transaction on at least one data record. A plurality of transactions originated from the first request may be organized in a first hierarchical tree-based data structure having multiple depth levels. The data structure may comprise a root node representing the first transaction and a leaf node representing a second transaction. The examples further enable detecting the abnormality based on at least one parameter where the at least one parameter comprises a size of the data structure and a depth level associated with the leaf node.