Auxiliary Mapping Data for Hierarchical Structure Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage systems using hierarchical data structures face inefficiencies in accessing data due to the time-consuming process of searching for data within these structures, which consumes processing resources and increases latency in operations like reading, writing, and updating.
Innovation Solution
The implementation of auxiliary mapping data, which includes a lookup table that maps keys or hash values to node IDs, allowing direct access to data within the hierarchical structure, thereby bypassing the need for extensive searches and reducing latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If hierarchical data structure search is used to locate data, then data can be found using key values, but search consumes time and processing resources
Solution Approach 1:
The patent creates auxiliary mapping data structures (lookup tables, hash tables) in advance that map keys directly to node identifiers. When data needs to be located, the system performs a preliminary lookup in these pre-built structures to obtain the exact node identifier, eliminating the need to traverse the hierarchical structure from the root node. This preliminary action of pre-computing and storing key-to-node mappings resolves the contradiction by making data location instantaneous while maintaining accuracy.
Solution Approach 2:
The patent introduces auxiliary mapping data structures as intermediary elements between the key and the hierarchical data structure. Instead of directly searching the hierarchical structure, the system uses these intermediary lookup tables that contain pre-computed mappings from keys to node identifiers. This intermediary layer acts as a shortcut, allowing the system to bypass the time-consuming hierarchical traversal while still achieving precise data location through the mapping relationship.
2Reliability
If hierarchical data structure search is used to locate data, then data can be accessed through nodes, but processing resources are consumed
Solution Approach 1:
The system pre-computes and stores mappings from keys to node identifiers in auxiliary data structures during data insertion or in background processes. When data access is needed, the system performs a simple lookup in these pre-built structures rather than traversing the hierarchical structure, significantly reducing processing resource consumption while maintaining reliable data access through the pre-established mappings.
Solution Approach 2:
The patent creates simplified copies of the hierarchical structure's essential mapping information in the form of lookup tables and hash tables. These copies contain only the critical key-to-node identifier mappings without the full hierarchical structure, allowing the system to perform fast lookups using these lightweight copies while the original hierarchical structure remains intact for data storage, thus reducing processing resources while maintaining access reliability.
3Speed
If direct access to data is enabled through auxiliary mapping, then latency is reduced, but additional data structures are required
Solution Approach 1:
The patent segments the data access functionality into two distinct parts: the original hierarchical data structure for data storage and the auxiliary mapping structures for fast key-to-node lookups. This segmentation allows each component to serve its specific purpose efficiently - the hierarchical structure maintains data organization while the auxiliary lookup tables provide direct access paths, reducing latency without compromising the integrity of the original data structure.
Solution Approach 2:
The auxiliary mapping data structures serve as intermediary layers between the key input and the hierarchical data structure. These intermediaries (lookup tables, hash tables) contain pre-computed mappings that bridge the gap between keys and node identifiers, enabling direct access without traversing the hierarchical structure. While this adds some structural complexity, it dramatically improves access speed by eliminating the need for hierarchical traversal.
Data Source
AI summary
A method includes accessing, in response to initiating an operation targeting data, auxiliary mapping data to determine whether the auxiliary mapping data includes an indication of a key associated with a node of a hierarchical data structure that is associated with the data. In response to the auxiliary mapping data including the indication of the key, the data is accessed from a memory using a node identification associated with the key. In response to the auxiliary mapping data not including the indication of the key, the data is accessed from the memory using a search operation.