Dynamic Tree Node Generation via Foreign Key Relationships
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current hierarchical data management approaches in relational databases are inefficient due to the need for separate storage of parent-child relationships, leading to increased computational resources and labor-intensive maintenance, especially as data complexity grows, and result in redundant data entry across multiple locations.
Innovation Solution
Nodes in a tree structure are dynamically generated based on foreign key relationships between different data sources and user-specified ranges, allowing users to specify criteria for creating entire levels of nodes rather than individually adding each node, and enabling automatic reflection of changes in the tree structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If parent-child relationship information is stored in a separate hierarchy from the underlying data sources, then the hierarchical structure can be maintained, but computer resources and storage space are consumed excessively
Solution Approach 1:
The patent merges the storage of parent-child relationship information with the underlying data sources by using foreign keys directly in the data tables. Instead of maintaining a separate hierarchy structure, the relationships are embedded within the data itself, eliminating redundant storage and reducing the need for separate memory structures.
Solution Approach 2:
The data sources are designed to serve multiple functions: they store both the actual data and the relationship information through foreign keys. This allows the same data structure to function as both the data storage and the hierarchy maintenance mechanism, reducing overall resource consumption.
2Adaptability or versatility
If the same information is stored in multiple locations to maintain hierarchical structures, then data can be accessed from different perspectives, but labor-intensive maintenance and redundant data entry occur
Solution Approach 1:
The patent combines multiple data storage locations into unified data sources that use foreign keys to establish relationships. This allows the same data to be accessed from different perspectives through query operations rather than requiring separate storage locations, eliminating redundant data entry and maintenance.
Solution Approach 2:
The system automatically maintains relationship information through foreign key constraints and referential integrity rules. When data is inserted, updated, or deleted, the system automatically updates related records through cascade operations, eliminating the need for manual maintenance of hierarchical relationships.
3Adaptability or versatility
If hierarchical data is stored in separate structures for different information sets, then data can be organized by category, but computational resources increase and data management becomes complex
Solution Approach 1:
The patent creates universal data sources that can represent different hierarchical structures through foreign key relationships. The same data storage mechanism can organize data by category, project, or any other dimension by simply changing the foreign key relationships, eliminating the need for separate storage structures for each organization type.
4Manufacturing precision
If manual node creation is used for each entry in the hierarchy, then precise control over the structure is achieved, but time consumption and labor requirements increase
Solution Approach 1:
The system automatically creates and maintains hierarchical structures by using foreign keys to establish parent-child relationships. When data is inserted into the database, the system automatically determines the hierarchical position and creates the necessary relationships without manual intervention, while still allowing precise control through defined relationship rules.
Data Source
AI summary
Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.


