Management Device K-Dimensional Index Retrieval Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques are inefficient in obtaining target information, particularly when it involves multiple pieces of partial information corresponding to two- or more-dimensional index values, as they often require multiple requests and increase communication overhead.
Innovation Solution
A management device that determines if target information is K-dimensional index information, prepares combined IDs based on index values, and uses GETNEXT requests to efficiently obtain partial information by identifying the greatest index values and adjusting subsequent requests accordingly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If multiple GETNEXT requests are transmitted to obtain K-dimensional index information, then the target information can be obtained, but the communication overhead and number of requests increase
Solution Approach 1:
The patent segments the K-dimensional index space into multiple sub-spaces based on the highest K-1 digits of index values. By dividing the retrieval task into segments corresponding to different sub-spaces, the system can process larger batches of index information in each request, reducing the total number of GETNEXT requests needed to obtain complete target information.
Solution Approach 2:
The patent performs preliminary action by preparing groups of combined IDs in advance, where each group contains multiple index values sharing the same highest K-1 digits. This pre-grouping allows the management device to transmit multiple index retrieval requests in a single GETNEXT request, thereby reducing communication overhead before the actual information retrieval begins.
2Loss of information
If traditional GETNEXT requests are used to obtain each piece of partial information, then all partial target information can be retrieved, but the device complexity and processing load increase
Solution Approach 1:
The patent merges multiple individual index retrieval operations into a single batched GETNEXT request by combining multiple combined IDs that share the same highest K-1 digits. This merging reduces the complexity of request management as the system handles fewer, more consolidated requests instead of numerous individual requests for each piece of partial information.
Solution Approach 2:
The patent introduces a new dimension of organization by grouping index values according to their highest K-1 digits, creating a hierarchical structure where requests are organized in batches corresponding to different digit combinations. This dimensional reorganization transforms the retrieval process from handling individual scattered requests to managing structured batches, simplifying the overall request management complexity.
Data Source
AI summary
A management device transmits to a target device a first GETNEXT request comprising a first group of Ma-combined IDs. Each combined ID is a combination of a target ID and one of Ma-index values. Each index value has a first value in its highest digit(s) and one of consecutive values in its lowest digit. The management device obtains Ma-partial information and a second group of an Ma-combined IDs corresponding to the Ma-partial information, identifies a greatest combined ID having a greatest index value from the second group, and transmits a second GETNEXT request comprising Mb-combined IDs comprising the identified greatest combined ID. Each combined ID is a combination of the target ID and one of Mb-index values. Each index value has a second value different from the second value in its highest digit(s) and one of consecutive values in its lowest digit.