Multidimensional Linked Lists for Fast Data Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data storage and retrieval methods in large computing arrays and hierarchical tree structures are inefficient, leading to significant time consumption and labor intensity, especially as the number of products and retailers increases.
Innovation Solution
Transforming hierarchical data structures into multidimensional linked lists and an in-memory computing array with pointers to nodes, allowing for quick data retrieval without parsing the hierarchical structures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data is stored in large computing arrays, then data can be stored, but searching takes a lot of time and occupies a lot of memory space
Solution Approach 1:
The patent segments the hierarchical tree structure into multiple multidimensional linked lists, where each linked list represents a specific dimension or path through the hierarchy. This segmentation allows the search process to focus on specific segments rather than traversing the entire tree, significantly reducing search time while maintaining efficient data storage.
Solution Approach 2:
The patent introduces multidimensional linked lists as an intermediary data structure between the hierarchical tree structure and the computing array. These linked lists serve as mediators that provide direct access paths to data, eliminating the need for time-consuming tree parsing while maintaining the hierarchical relationships.
2Quantity of substance
If hierarchical tree structures are used to store data, then memory space is optimized, but tree parsing algorithms are time-consuming
Solution Approach 1:
The patent performs preliminary action by pre-converting the hierarchical tree structure into multidimensional linked lists before the actual search operation. This pre-processing step creates direct access paths that eliminate the need for time-consuming tree parsing during search operations, while the linked lists maintain compact memory representation.
Solution Approach 2:
The patent transforms the traditional single-dimension hierarchical tree structure into multidimensional linked lists, adding dimensional perspectives to the data organization. This dimensional transformation allows for multiple access paths and direct navigation, significantly reducing parsing time while maintaining memory efficiency.
3Measurement precision
If manual price determination is used for each product and retailer, then pricing accuracy is maintained, but labor intensity and time consumption increase significantly
Solution Approach 1:
The patent implements self-service by enabling the system to automatically retrieve and process pricing data through the multidimensional linked lists and computing array. The pre-organized data structures allow the system to self-serve pricing information without manual intervention, maintaining accuracy while dramatically improving efficiency and reducing labor intensity.
Data Source
AI summary
A computing server is described that can transform hierarchical data structures (for example, tree structures, which are also referred to as trees) storing data into multidimensional linked lists and an in-memory computing array (also referred to herein as a computing array). The computing array can include pointers to nodes of the multidimensional linked lists. The storage of data in the form of multidimensional linked lists and computing arrays can enable the computing server to quickly retrieve data values from the data stored in the hierarchical data structures without parsing the hierarchical data structures. Related apparatuses, systems, techniques, and articles are also described.