In-Memory Process Protocol for Parallel Path Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for analyzing business processes based on digital trails in IT systems are inflexible, inefficient, and unable to handle complex, potentially parallel processes effectively, especially when dealing with large datasets.
Innovation Solution
A method and system utilizing Advanced Process Algebra Execution (APE) queries to analyze process protocols stored in-memory, allowing for flexible and efficient analysis of complex processes by combining process operators with database functions, enabling direct access and ad-hoc analysis of process protocols.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If process data is extracted from source systems and stored in a separate database for analysis, then data can be analyzed, but flexibility and performance of analysis are restricted
Solution Approach 1:
The patent merges the process data storage and analysis functions into a single in-memory data structure called ProcessProtocol, eliminating the need for separate extraction and transformation steps. This integration enables direct analysis of complex parallel processes while maintaining system simplicity.
Solution Approach 2:
The ProcessProtocol data structure serves multiple functions simultaneously: it stores process data, enables ad-hoc queries, supports parallel process analysis, and provides flexible interrogation capabilities. This multi-functionality resolves the contradiction by providing versatile analysis without requiring additional system complexity.
2Adaptability or versatility
If predefined analyses are used, then analysis can be carried out, but flexibility to analyze arbitrary complex processes is restricted
Solution Approach 1:
The patent implements dynamic analysis capabilities through APE queries that can adapt to arbitrary process structures. The system transitions from static predefined analyses to dynamic ad-hoc queries that can handle complex parallel processes of any configuration, maintaining high performance while providing full flexibility.
Solution Approach 2:
The system changes the analysis approach by using parameterized APE queries that can be adapted to different process configurations. This allows efficient analysis of arbitrary complex processes by modifying query parameters rather than requiring completely different analysis methods.
3Quantity of substance
If algorithms process very large datasets with hundreds of millions of process instances, then comprehensive analysis is possible, but performance becomes insufficient
Solution Approach 1:
The patent performs preliminary organization of process data into the ProcessProtocol data structure with built-in indexing and ordering capabilities. This preliminary structuring enables efficient querying and analysis of large datasets without requiring complex processing algorithms, maintaining high performance even with hundreds of millions of process instances.
4Measurement precision
If process data is stored in a separate database, then data can be analyzed, but accuracy in analyzing complex parallel processes is reduced
Solution Approach 1:
By merging the process data storage and analysis functions into the ProcessProtocol structure, the system eliminates data transformation losses and maintains complete accuracy in analyzing complex parallel processes. The integrated approach ensures no information is lost during extraction or transformation.
Data Source
AI summary
A computer-implemented method is provided for determining parallel process paths in process data. In a first step, a status hierarchy is generated from process steps stored in a storage means, wherein the process steps are read from the storage means and are added to the status hierarchy, and wherein for each added process step, a predecessor/successor relation is added to at least one further process step to the status hierarchy. In a second step, a process hierarchy of the process instance comprising nodes and edges is deduced from the process steps stored in the status hierarchy and the respective predecessor and/or successor relations.