Information Processing Device Segmenting Key Ranges for Attribute Handling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing event distribution systems face inefficiencies when adding new attribute names, requiring the generation of an infinite number of hubs and significant processing time to establish links between new nodes and existing hubs, making it impractical to handle attribute names not set in advance.
Innovation Solution
An information processing device that divides the range of a key into segments using attribute names and attribute values, generating keys in a size-comparable form to determine whether new attribute names are included in existing segments, thereby reducing processing time for adding attribute names.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the system generates a node corresponding to a new attribute name at the timing when the attribute name is added, then the system can handle attribute names not set in advance, but it takes time to perform processing in each node for adding the attribute name
Solution Approach 1:
The patent segments the key range into multiple segments and assigns each segment to a different node. When a new attribute name is added, only the node managing the corresponding segment needs to process it, rather than requiring all nodes to perform processing. This segmentation approach enables the system to handle new attribute names while significantly reducing the processing time burden on each individual node.
2Adaptability or versatility
If the system tries to produce hubs for all unknown attribute names in advance, then all attribute names can be handled, but an infinite number of hubs are needed which is impossible
Solution Approach 1:
The patent performs preliminary actions by pre-defining a finite number of segments and assigning them to nodes before new attribute names are introduced. This preliminary segmentation structure is established in advance, but unlike the impossible approach of creating infinite hubs, it uses a manageable finite segmentation that can accommodate new attribute names dynamically as they are added, without requiring pre-creation of all possible hubs.
3Stability of the object's composition
If the system establishes links between a newly generated node and all nodes constituting other existing hubs, then the new node can be integrated into the system, but it takes significant time to perform this link establishment processing
Solution Approach 1:
The patent segments the system into independent nodes, each managing specific key range segments. When a new node is added, it only needs to establish connections related to its assigned segment rather than linking with all existing nodes. This segmentation dramatically reduces the link establishment time while maintaining system stability and integration.
Data Source
AI summary
An information processing device reduces a time of processing for adding an attribute name performed in each node. The device memorizes its own segment. This segment is at least one segment among each segment made by dividing a range of a key into a plurality of segments, so as to make the segments neighbor with each other. The key is generated about at least two attribute names using an attribute name and an attribute value based on a specified order relation and is of size-comparable form. The device judges whether a key generated from an attribute name and an attribute value is included in its own segment or not.