Graph Subgraph Extraction via Pre-assigned Edge Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional methods for storing and analyzing graphs representing modern networks, such as supply chain and process networks, are inefficient and prone to errors due to the need for manual connection of nodes and the computational demands of handling large datasets.
Innovation Solution
A computer-implemented method for filtering a graph by recording nodes and their relationships in a data structure without prior knowledge of the network structure, allowing for the extraction of subgraphs and efficient analysis of network effects.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If traditional methods are used to store and analyze graphs representing modern networks, then nodes can be stored in disconnected manner in relational data tables, but manual connection of nodes is highly inefficient and prone to errors
Solution Approach 1:
The patent applies preliminary action by pre-assigning unique relationship identifiers to edges during the initial data recording phase. Instead of manually connecting nodes later, the system prepares the connection information in advance by storing relationship identifiers in the data structure, enabling automatic graph reconstruction without manual intervention.
Solution Approach 2:
The system enables self-service by allowing the graph structure to be automatically reconstructed from the stored relationship identifiers. The data structure itself contains all necessary connection information, and the graph emerges automatically when the data is read, eliminating the need for manual node connection operations.
2Reliability
If manual connection of nodes is performed to reconstruct the graph, then the graph structure can be established, but the process is computationally very demanding and leads to timeouts
Solution Approach 1:
The patent uses copying by storing relationship identifiers as copies of connection information in the data structure. Instead of performing complex computational operations to determine node connections, the system stores pre-computed relationship identifiers that can be quickly retrieved and used to reconstruct the graph structure.
Solution Approach 2:
The system replaces the mechanical process of manual node connection with an automated information-based system. Relationship identifiers serve as digital proxies for physical connections, allowing the graph structure to be reconstructed through data processing rather than computational algorithms.
3Adaptability or versatility
If the graph represents large networks with many interconnected entities, then comprehensive analysis is possible, but data storage requirements and computational complexity increase significantly
Solution Approach 1:
The patent applies segmentation by dividing the graph structure into independent nodes and edges, each represented as separate records in the data structure. This segmentation allows the system to handle large networks by processing individual components rather than the entire graph at once, reducing computational complexity while maintaining the ability to represent comprehensive network relationships.
Data Source
AI summary
Provided is a computer-implemented method to extract a subgraph from a graph which is stored with a storage device without prior knowledge of the structure of the graph. The graph represents a network. The subgraph starts from at least one selected node into a selected direction. Each directed edge of the graph is composed of an outgoing edge which is connected to a start node and an incoming edge which is connected to an end node. The subgraph is extracted according to a traversal of the graph starting from the at least one selected node into the selected direction according to a predefined graph traversal protocol.