Validity Path Node Pattern for Time-Dependent Acyclic Graphs

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Accessing and processing time-dependent data in acyclic graph structures is challenging due to the need for sophisticated evaluation of node and relation validities over defined time periods, which complicates data retrieval and processing, especially in legacy systems without migration requirements.

Innovation Solution

A system and process that generate a graph valid for a specified validity period by comparing the identified validity period to the nodes and relations of the graph structure, skipping invalid nodes and relations, and storing validity periods as node attributes, allowing for generic graph functions to be performed independently of the graph structure.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If sophisticated evaluation of node and relation validities is performed for time-dependent graphs, then data integrity is maintained, but processing time increases and system complexity increases

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system pre-evaluates and determines the validity periods of all nodes and relations before graph processing. By performing validity checks in advance and caching the results, the system avoids repeated sophisticated evaluations during actual graph operations, thus maintaining data integrity while reducing processing time.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The validity evaluation logic is extracted as a separate preprocessing step from the main graph processing workflow. This allows the complex validity determination to be performed once and independently, separating the time-consuming integrity check from the actual data retrieval operations.

Inventive Principle:
Principle #2Taking out (Extraction)

2Reliability

If sophisticated evaluation of node and relation validities is performed for time-dependent graphs, then data integrity is maintained, but device complexity increases

Engineering Contradiction:
Improvedata integrityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The graph processing system is segmented into distinct modules: a validity evaluation module that handles time-dependent checks, and a graph processing module that operates on pre-validated data. This segmentation isolates the complexity of validity evaluation to a dedicated component, making the overall system more manageable and maintainable.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

A validity metadata layer is introduced as an intermediary between the raw graph data and the processing logic. This intermediate layer stores pre-computed validity information, allowing the main processing system to operate with simpler logic while still ensuring data integrity through the metadata validation layer.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If graph structure identification is required prior to data access, then data retrieval accuracy is improved, but ease of operation decreases

Engineering Contradiction:
Improvedata retrieval accuracyVSAvoidease of access
Core Design Contradiction:
Measurement precisionVSEase of operation

Solution Approach 1:

The system implements a universal graph access interface that handles multiple graph types (time-dependent, static, different topologies) through a single unified mechanism. The interface automatically adapts to the specific graph structure being accessed, eliminating the need for users to manually identify or configure graph-specific access patterns while maintaining accurate data retrieval.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS9165087B2Validity path node pattern for structure evaluation of time-dependent acyclic graphs
Publication Date: 2015.10.20 SAP SE
  • US9165087B2 patent drawing
  • US9165087B2 patent drawing
  • US9165087B2 patent drawing

AI summary

Systems and processes may access data using a generic graph framework or other graph interface upon request from a business application. Some data retrieved by the interface may be organized as an acyclic graph structure that includes some temporal, time-based, or otherwise time-dependent nodes. In some cases, the acyclic graph may include one or more time-dependent relations. As the datasets are time-dependent, the parents/children can be processed based on their identifiers in combination with the corresponding validities. Additionally, the actual validities during evaluation of the graph may yet to be computed for each element out of the validities of its predecessors. This accessed data, with at least some time-dependent data, can be compared to a validity period provided by the business application to generate a graph valid for the validity period.