Simulation Data Map With Hierarchical Property Keys
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Computer simulations face significant overhead in data retrieval due to the increasing amount of data being stored and accessed, particularly in dynamic databases, where the time spent on memory address lookups grows with the amount of data, necessitating a systematic approach for sorting and storing large datasets while maintaining flexibility and performance.
Innovation Solution
A simulation system uses a map to store associations between property keys and memory addresses, allowing for efficient data retrieval by searching property keys lexicographically, enabling dynamic attribute management and fast data referencing through contiguous host and device arrays for parallel computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data is stored in a dynamic database with increasing amounts of simulation data, then the data storage capacity is improved, but the time spent on memory address lookups increases
Solution Approach 1:
The patent applies preliminary action by pre-sorting simulation data according to a systematic scheme before retrieval operations. Data is organized in advance using property keys and hierarchical sorting (primary sort by property type, secondary sort by modifier), so that when retrieval occurs, the data is already in an optimal state for fast access. This eliminates the need for time-consuming lookups during actual data retrieval operations.
Solution Approach 2:
The patent changes the parameter of data organization by introducing a hierarchical sorting scheme based on property keys. Instead of storing data in arbitrary or simple sequential order, the system transforms the data structure into a multi-level hierarchy where data is sorted first by property type (e.g., position, velocity, temperature) and then by modifiers (e.g., x-coordinate, y-coordinate, z-coordinate). This parameter transformation enables faster retrieval as the search space is systematically reduced at each hierarchical level.
2Productivity
If a systematic sorting scheme is implemented for large datasets, then data access efficiency is improved, but the complexity of data management increases
Solution Approach 1:
The patent applies segmentation by dividing the data management system into distinct hierarchical levels. Each level handles a specific aspect of data organization: the top level sorts by property type, intermediate levels sort by modifiers, and the lowest level contains the actual data arrays. This segmentation allows each component to operate independently and efficiently, reducing the overall complexity compared to a monolithic sorting approach.
Solution Approach 2:
The patent creates a universal data management framework that handles multiple types of simulation data (position, velocity, temperature, pressure, etc.) through a single consistent sorting and retrieval mechanism. The property key system and hierarchical sorting scheme are designed to be property-agnostic, meaning the same infrastructure serves all different types of simulation data, reducing the need for separate management systems for each data type.
3Adaptability or versatility
If property keys with multiple modifiers are used to track dataset operations, then data retrieval flexibility is improved, but the lookup operation complexity increases
Solution Approach 1:
The patent adds dimensional structure to the data retrieval system by introducing hierarchical levels based on property keys and modifiers. Instead of a flat, single-dimensional lookup, the system creates multi-dimensional access paths where data can be retrieved by progressively narrowing down through hierarchical levels (property type → modifier → specific data). This dimensional approach increases flexibility while managing complexity through structured progression.
Solution Approach 2:
The system performs preliminary organization of data by property keys and modifiers during the data insertion phase. This pre-grouping means that when a retrieval operation occurs, the system can quickly navigate through pre-established hierarchical categories rather than searching through all data. The modifiers are pre-sorted and organized, so even complex queries with multiple modifiers benefit from the advance preparation.
Data Source
AI summary
A simulation system receives a request to retrieve simulation data from memory of a computing system. The received request includes a property key identifying the simulation data to be retrieved. The property key is searched in a map storing associations between a plurality of property keys and memory where simulation data associated with a corresponding property key is stored. The memory for the requested simulation data accessed to obtain the requested simulation data.