Event Pattern Matching Automaton Construction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional event pattern matching techniques are inefficient due to the need to include all combinations of occurrence orders for conjunction patterns, leading to high computational complexity and resource usage, especially when dealing with conjunction patterns containing multiple events.
Innovation Solution
A matching device that builds a parse tree from an event pattern and constructs a nondeterministic finite automaton by joining child nodes in parallel, allowing for efficient matching by transitioning to AND or OR nodes based on event occurrences, thereby reducing the need to consider all combinations of occurrence orders.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional event pattern matching includes all combinations of occurrence orders for conjunction patterns, then matching accuracy is improved, but computational complexity and resource usage increase significantly
Solution Approach 1:
The patent segments the event pattern matching process into distinct components: parse tree construction from the event pattern, automaton building from the parse tree, and pattern matching execution using the automaton. This segmentation allows each component to handle specific aspects of the matching task independently, reducing overall computational complexity while maintaining accuracy.
Solution Approach 2:
The patent performs preliminary actions by constructing a parse tree and building an automaton before executing the actual pattern matching. The parse tree is built from the event pattern to represent the logical structure, and the automaton is constructed from this parse tree to enable efficient matching. These preliminary structures are reused during matching operations, avoiding the need to compute all combinations of occurrence orders during the matching phase itself.
2Measurement precision
If conventional event pattern matching includes all combinations of occurrence orders for conjunction patterns, then matching accuracy is improved, but resource usage increases significantly
Solution Approach 1:
The patent segments the event pattern matching process into distinct components: parse tree construction from the event pattern, automaton building from the parse tree, and pattern matching execution using the automaton. This segmentation allows each component to handle specific aspects of the matching task independently, reducing overall computational complexity while maintaining accuracy.
Solution Approach 2:
The patent creates a simplified copy or representation of the event pattern through the parse tree and automaton structures. Instead of directly processing all combinations of occurrence orders, the system uses these intermediary representations that capture the essential matching logic with reduced resource requirements. The automaton serves as a compact copy of the pattern's matching behavior.
3Adaptability or versatility
If real-time detection of matching start and completion times is implemented, then event stream analysis capability is improved, but processing complexity increases
Solution Approach 1:
The patent performs preliminary actions by constructing a parse tree and building an automaton before executing the actual pattern matching. The parse tree is built from the event pattern to represent the logical structure, and the automaton is constructed from this parse tree to enable efficient matching. These preliminary structures are reused during matching operations, avoiding the need to compute all combinations of occurrence orders during the matching phase itself.
Solution Approach 2:
The patent implements feedback mechanisms to track matching progress in real-time. The system monitors event stream processing and uses the automaton state transitions to determine when patterns are matched, providing feedback about matching start and completion times. This feedback enables real-time detection without requiring exhaustive analysis of all possible event combinations.
Data Source
AI summary
A matching device builds a parse tree from an event pattern. The matching device builds an automaton by, while traversing the parse tree, joining child nodes of an AND node in parallel to the AND node and joining child nodes of an OR node in parallel to the OR node. The matching device performs matching of determining whether an event stream includes the event pattern by comparing the event stream with the automaton.