Event Matching Table for Reducing Notification Processing Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The inefficiency in matching event notifications to subscriber requests due to the computational taxing nature of comparing millions of events to unique subscriber requests, leading to a drain on computational resources.
Innovation Solution
A method and system utilizing an event matching table with parent nodes assigned unique subscriber request values, where event data is formatted and routed efficiently to select the appropriate nodes without comparing each event to every subscriber, reducing processing time by using a preprocessing module, table index, and alert manager to manage notifications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional comparison methods are used to match events to subscriber requests, then all subscriber requests can be accurately matched, but computational resources are heavily drained and processing time is excessive
Solution Approach 1:
The patent segments the large set of subscriber requests into smaller groups organized in an event matching table with parent nodes and child nodes. Each parent node represents a category or type of event, and child nodes represent specific subscriber requests within that category. This segmentation allows the system to process events by first identifying the relevant parent node category, then efficiently matching to specific child nodes, rather than comparing against every single subscriber request individually.
Solution Approach 2:
The patent performs preliminary action by pre-organizing subscriber requests into the event matching table structure before events occur. The table is built in advance with parent nodes categorizing different event types and child nodes containing specific subscriber requests. When an event occurs, the system already has the matching structure ready, eliminating the need for real-time comprehensive comparisons and enabling rapid matching.
2Reliability
If comprehensive event matching is performed for all subscribers, then no matching requests are missed, but processing time increases from 0.0003 seconds to 8 seconds
Solution Approach 1:
The event matching table segments subscriber requests hierarchically into parent nodes (event categories) and child nodes (specific requests). This allows the system to first match an event to a parent node category, then efficiently identify relevant child nodes, ensuring comprehensive matching while reducing the search space and processing time significantly.
Solution Approach 2:
The system performs preliminary organization of all subscriber requests into the hierarchical event matching table structure before event processing. This pre-computation creates an optimized lookup structure that enables complete matching of all relevant subscribers while reducing processing time from 8 seconds to 0.0003 seconds during actual event matching.
3Adaptability or versatility
If traditional event notification systems are used, then all event types can be monitored, but the system becomes computationally taxing with millions of events and subscriber requests
Solution Approach 1:
The patent divides the complex task of monitoring millions of events against millions of subscriber requests into manageable segments through the event matching table. Parent nodes represent different event categories or types, allowing the system to handle diverse event monitoring requirements while reducing computational complexity by organizing requests hierarchically rather than processing them as a single large set.
Data Source
AI summary
An event notification matching system, including an event matching table forming a plurality of nodes. Each node is assigned a subscriber request value and contains identifiers for one or more subscribers to be notified at the occurrence of an event relating to the subscriber request value. The event notification matching system may also include a table index. The table index receives input values from an event processing module and selects one or more of the nodes that have subscriber request values corresponding to the received input values. The event processor receives event data from a predetermined source, and formats the input values to simplify the operations performed by the event matching table. The event notification matching system is configured such that the event data need not be compared to non-matching nodes in the event matching table.