Reverse Real-Time Graph Pattern Matching for Event-Driven Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing graph pattern matching technologies face challenges in real-time event-driven scenarios due to high computational complexity, resource exhaustion, and delayed matching results, which are unsuitable for low-latency and high-availability requirements in fields like finance, e-commerce, and public security.
Innovation Solution
A reverse real-time matching method based on event-driven graph patterns, utilizing a linked list of matching steps and a reverse matching architecture that includes a Session Manager, Working Graph Loader, Graph Pattern Matcher, and Subgraph Matching Pool, to efficiently match graph patterns by loading specific vertices and edges, managing resource constraints, and optimizing matching speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional graph pattern matching is used in event-driven real-time scenes, then matching accuracy can be maintained, but system delay increases and real-time performance deteriorates
Solution Approach 1:
The patent inverts the traditional matching direction by starting from fixed vertices (event sources) and performing reverse matching to find target graph patterns. This inversion transforms the problem from global subgraph search to directed reverse matching, significantly reducing search space and delay while maintaining matching accuracy
Solution Approach 2:
The patent segments the graph matching process into discrete matching steps organized as a linked list, where each step processes specific vertices and edges. This segmentation enables incremental matching and early termination, reducing overall matching time while preserving accuracy
2Reliability
If resource limits are set to ensure system availability, then system可用性 is improved, but matching accuracy of some scenes deteriorates
Solution Approach 1:
The patent applies partial action by setting resource limits (maximum vertices, edges, depth, time) on the matching process. When limits are reached, the system terminates matching early to ensure availability, accepting that some complex patterns may not be fully matched. This partial matching approach maintains system reliability while preserving accuracy for simpler, more critical patterns
3Productivity
If graph pattern matching starts from fixed vertices in event-driven scenes, then matching speed is improved, but the complexity of managing matching states increases
Solution Approach 1:
The patent introduces matching contexts as intermediary data structures to manage matching states. These contexts store intermediate results and support matching conditions for non-adjacent vertices or edges, effectively mediating between the simplified reverse matching process and the complex state management requirements
Solution Approach 2:
The patent implements nested matching steps where each matching step contains nested vertex and edge predicates. This nesting structure allows complex matching logic to be organized hierarchically, improving speed through structured processing while managing complexity through nested organization
Data Source
AI summary
Provided is a method for reverse real-time matching based on event-driven graph patterns. The method includes definition of a graph pattern, establishment of reverse matching architecture and a reverse matching method; and the graph pattern is used for describing a spatial connection relationship among vertices and edges in a graph in a reverse order and attribute constraints thereof, and includes a linked list of matching steps and matching contexts. Reverse real-time matching of the graph pattern is realized according to the reverse matching architecture, and the problem of event-driven subgraph matching in a real-time scene is solved.