Dynamic Graph Subgraphs via Descriptive Views
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current graph databases struggle to dynamically manage subgraphs as the underlying graph changes, requiring manual addition of vertices and failing to accommodate edges that are not directly connected, leading to invalid subgraph definitions.
Innovation Solution
The method involves defining subgraph content descriptively using a graph description or traversal language, allowing vertices to be automatically included and maintaining the original intent of the subgraph even as the graph evolves, by storing queries that express subgraphs and evaluating them into static views.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If subgraphs are defined using a static set of objects, then the subgraph definition is simple and explicit, but the subgraph becomes invalid when the underlying graph changes and requires manual updates
Solution Approach 1:
The patent transforms static subgraph definitions into dynamic ones by introducing triggers that automatically detect graph changes (additions, deletions, modifications) and propagate these changes to affected subgraphs. This allows subgraphs to adapt automatically to graph evolution without manual intervention, resolving the contradiction between simple definition and adaptability to changes.
Solution Approach 2:
The system implements a feedback mechanism where graph changes are detected and trigger automatic updates to subgraphs. The trigger system monitors the graph structure and sends notifications to subgraphs that need updating, creating a closed-loop system that maintains subgraph validity dynamically without requiring manual redefinition.
2Reliability
If vertices are added manually to subgraphs, then the subgraph definition remains explicit and controlled, but the process becomes time-consuming and error-prone
Solution Approach 1:
The patent enables subgraphs to self-update automatically when the underlying graph changes. Triggers detect changes in the graph structure and automatically propagate these changes to affected subgraphs, eliminating the need for manual vertex addition or removal. This self-service mechanism maintains accuracy while eliminating time-consuming manual maintenance.
Solution Approach 2:
The system performs preliminary actions by pre-defining trigger conditions and update rules for subgraphs. When graph changes occur, the pre-configured triggers automatically execute the appropriate update actions, eliminating the need for manual intervention and reducing both time loss and potential errors in subgraph maintenance.
3Ease of operation
If edges are induced from vertices in subgraphs, then the subgraph structure is automatically maintained, but edges that are two or more edges away cannot be accommodated
Solution Approach 1:
The patent extends edge induction beyond direct connections by introducing spanning edges that can connect vertices two or more edges away. This dimensional extension allows the subgraph to include distant vertices while maintaining the automatic induction mechanism, resolving the limitation of traditional edge induction that only worked for directly connected vertices.
4Reliability
If explicit subgraph management is performed, then control over subgraph content is maintained, but the complexity of managing dynamic graphs increases
Solution Approach 1:
The patent segments the subgraph management system into independent triggers and update rules for each subgraph. Each subgraph has its own trigger configuration and update logic, allowing granular control without requiring complex centralized management. This segmentation maintains reliability through localized control while reducing overall system complexity through modularity.
Data Source
AI summary
Embodiments for a method of implementing dynamic subgraphs in a graph database by defining vertices of a subgraph descriptively in such a way that the original intent of the content is preserved while the subgraph itself is changing. A database process preserves a “view” of the database as a stored query which will define a subgraph members while the subgraph members are modified, and as opposed to a method in which edges are induced from their vertices to be included in the subgraph, by defining the content of a subgraph descriptively using a database view, vertices which are new and should be contained in the subgraph will automatically be included.