Hierarchical Data Object Management with Dynamic Memory Loading
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face computational inefficiencies in managing and processing large numbers of rules and transaction records to determine attribution weights for nodes in hierarchical data structures, leading to increased computational costs and potential rule conflicts.
Innovation Solution
A computer-implemented method that includes displaying a hierarchy graph, detecting changes in node connectivity, adjusting node levels, and modifying attributes in a database, while optimizing memory usage by loading only necessary attributes and levels of nodes into memory, enabling efficient processing and rule governance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If all nodes and attributes of hierarchical data structures are loaded into memory for processing, then processing speed and accessibility are improved, but memory consumption increases significantly
Solution Approach 1:
The patent segments the hierarchical data structure into multiple levels and loads only the necessary level into memory at any given time. The system divides the hierarchy into parent levels (loaded into memory for active processing) and child levels (stored in database tables for on-demand retrieval), allowing efficient processing without loading the entire structure into memory simultaneously.
Solution Approach 2:
The patent applies local quality by differentiating between first attributes (stored in memory for frequently accessed nodes) and second attributes (stored in database tables for less frequently accessed nodes). This allows the system to optimize memory usage by storing only the most critical attributes in memory while maintaining comprehensive data availability in the database.
2Productivity
If computational resources are increased to handle complex rule processing and attribution weight determination, then processing capability is improved, but computational cost increases
Solution Approach 1:
The patent implements preliminary action by pre-calculating and storing attribution weights in the database tables before they are needed for processing. When a node is selected, the system retrieves pre-computed weights rather than performing complex calculations in real-time, significantly reducing computational resources required during active processing while maintaining high processing capability.
3Ease of operation
If the entire hierarchical structure is displayed and accessible at once, then user accessibility is improved, but system complexity and memory usage increase
Solution Approach 1:
The patent implements dynamic loading where the system adapts to user interactions by loading additional levels into memory only when parent nodes are selected. The hierarchy graph dynamically adjusts its content based on user navigation, loading child levels on-demand and unloading them when no longer needed, providing full accessibility without requiring the entire structure to be permanently resident in memory.
Data Source
AI summary
Implementations described herein relate to methods, systems, and computer-readable media to create and maintain hierarchies. In some implementations, a method may include displaying, on a user interface, a hierarchy graph that includes a plurality of nodes, wherein each of the nodes is associated with a corresponding data structure in a database table, and wherein each of the nodes is associated with a set of first attributes and a set of second attributes; detecting an indication of a change to connectivity of a first node of the plurality of nodes; in response to detecting the indication of the change to the connectivity of the first node, determining a change to the first attributes of one or more modified nodes of the plurality of nodes; modifying the first attributes in a database that correspond to the one or more modified nodes; and displaying a modified hierarchy graph on the user interface.