Event Processing Nodes Using Magnitude Comparison Keys
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In event distribution systems with hubs corresponding to attribute names, adjusting the load on nodes is cumbersome due to the need to assign successors and cross-hub adjacent nodes, and performing random walks increases processing costs.
Innovation Solution
The system generates key information by converting attribute names and values into a format enabling magnitude comparison, allowing for efficient determination of whether events should be processed and transferring them to appropriate nodes, thereby facilitating load adjustment without the need for multiple hubs or random walks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If hubs corresponding to attribute names are used for event distribution, then event processing can be organized by attribute, but load adjustment becomes cumbersome requiring assignment of successors and cross-hub adjacent nodes
Solution Approach 1:
The patent extracts the hub structure entirely from the system. Instead of using hubs corresponding to attribute names that require complex successor and cross-hub adjacent node assignments, the invention directly uses nodes to receive and process events based on their subscription conditions. This eliminates the intermediate hub layer and simplifies load adjustment to merely reassigning events between nodes without complex topological relationships.
Solution Approach 2:
The patent makes nodes universal by enabling them to handle events with any attribute name directly, without requiring specialized hub structures. Each node can subscribe to events with different attribute names and conditions, making the node structure multi-functional and eliminating the need for attribute-specific hubs, thereby simplifying load adjustment procedures.
2Reliability
If random walks are performed to determine cross-hub adjacent nodes, then proper node connections can be established, but processing costs increase
Solution Approach 1:
The patent removes the random walk mechanism entirely from the system. By eliminating the hub structure that required cross-hub adjacent node determination through random walks, the invention directly establishes event routing based on subscription conditions at nodes, thereby eliminating the processing overhead of random walks while maintaining reliable event delivery.
3Adaptability or versatility
If multiple hubs corresponding to different attribute names are maintained, then events can be distributed by attribute type, but the system requires more processing overhead for hub management
Solution Approach 1:
The patent merges the functionality of multiple attribute-specific hubs into a single node-based structure. Instead of maintaining separate hubs for different attribute names, the invention allows nodes to handle events with any attribute name by evaluating subscription conditions directly, thereby combining hub functionalities into nodes and eliminating the processing overhead of hub management while preserving attribute-based event distribution capability.
Data Source
AI summary
An information processing system 5 according to the present invention includes a plurality of nodes each of which includes a key information generation unit 51 that generates first key information by converting an attribute name and an attribute value included in a received event information into a format that enables a magnitude comparison of the attribute name and the attribute value, a process target information storing unit 53 that stores key information of a predetermined attribute name and an attribute value within the predetermined range in advance, a target determination unit 52 that determines whether the event information should be handled as information to be processed or not by comparing the first key information with the second key information, and an information transfer unit 54 that transmits the event information that should not be handled as information to be processed and the first key information to another node.