Hierarchical Storage List Retrieval via Single Depth Request
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage systems face inefficiencies in list retrieval due to the need for multiple commands and lack of filtering capabilities in management interfaces, such as those using RESTful APIs.
Innovation Solution
A system and method for list retrieval in a storage device that allows a single data request with a specified depth level and filter criteria, enabling the retrieval of data from multiple nodes in a hierarchical structure without the need for multiple commands.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If multiple commands are used to retrieve data from different nodes in a hierarchical structure, then complete data retrieval is achieved, but the time and complexity of the operation increase
Solution Approach 1:
The patent combines multiple separate data retrieval commands into a single command that can fetch data from multiple hierarchical nodes simultaneously. The system processes a single request to retrieve parent node data and child node data together, eliminating the need for sequential commands and reducing overall retrieval time while maintaining complete data acquisition.
2Loss of information
If multiple commands are issued to access different hierarchical levels, then all required data is obtained, but the complexity of the operation increases
Solution Approach 1:
The system merges multiple hierarchical level queries into a unified retrieval operation. A single command structure enables access to parent nodes, child nodes, and intermediate levels without requiring separate commands for each hierarchical tier, thereby simplifying the operational complexity while ensuring complete data collection.
Solution Approach 2:
The retrieval system is designed with multi-functionality to handle various hierarchical node access patterns through a single command interface. The universal command structure can adapt to retrieve data from any combination of hierarchical levels (parent, child, grandchild nodes) without requiring specialized commands for each scenario, reducing operational complexity.
3Productivity
If all data from multiple nodes is retrieved in a single operation, then efficiency is improved, but the data volume to be processed increases
Solution Approach 1:
The system extracts and retrieves only the specific data portions that are actually needed from the hierarchical nodes, rather than indiscriminately fetching all available data. The retrieval mechanism selectively extracts relevant information from parent nodes, child nodes, and intermediate levels based on the request parameters, thereby maintaining high efficiency while minimizing unnecessary data volume.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Systems and methods for list retrieval in a storage device are provided that significantly reduces the number of commands needed to retrieve data. A single command or request may be issued to receive data stored at a parent node, a child node and/or a grandchild mode. For example, a request may be issued that includes a node corresponding to a particular level, a depth level below that particular level to which obtained data and/or filter criteria. With this information, the requested information may be obtained to the depth level while filtering out information not included in the request. When the request corresponds to a parent node and information about the children nodes is desired, for example, additional requests are not needed to obtain information from all of the parent node and the children nodes. Thus, the length of time needed to provide certain stored management information is reduced.