Dynamic Tree Node Generation via Foreign Key and Range Criteria

Resolve Bottlenecks,
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 relationship information, leading to high resource usage and labor-intensive maintenance, especially as data complexity increases, and require manual entry of each node, which is redundant and time-consuming.

Innovation Solution

Nodes in a tree structure are dynamically generated based on foreign key relationships and user-specified ranges, allowing users to specify criteria for creating multiple nodes at once, reducing the need for manual node creation and optimizing storage and maintenance by querying relational tables for records that satisfy specified criteria.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If parent-child relationship information is stored separately from underlying data sources, then hierarchical data can be represented and managed, but computer resource usage increases and storage space is consumed

Engineering Contradiction:

Improvehierarchical data representationVSAvoidcomputer resource usage

Core Design Contradiction:

Adaptability or versatilityVSUse of energy by moving object

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 separate hierarchy tables, the hierarchical relationships are embedded within the existing data structure, eliminating redundant storage and reducing computer resource usage while preserving hierarchical data representation capabilities.

Inventive Principle:

Principle #5Merging (Combining)

Solution Approach 2:

The data tables are designed to serve multiple functions: they store both the underlying data and the hierarchical relationship information through foreign keys. This multi-functional design allows the same table structure to support both data storage and hierarchy management, reducing the need for separate specialized storage structures.

Inventive Principle:

Principle #6Universality (Multi-functionality)

2Stability of the object's composition

If parent-child relationship information is stored separately, then hierarchical structure can be maintained, but maintenance becomes labor-intensive

Engineering Contradiction:

Improvehierarchical structureVSAvoidmaintenance effort

Core Design Contradiction:

Stability of the object's compositionVSEase of manufacture

Solution Approach 1:

By combining relationship information with data sources through foreign keys, the patent eliminates the need for separate maintenance operations. When data is updated in the underlying tables, the hierarchical relationships are automatically reflected without requiring manual updates to separate relationship structures, significantly reducing maintenance effort while preserving structural stability.

Inventive Principle:

Principle #5Merging (Combining)

3Ease of operation

If manual entry of each node is required, then tree structure can be created, but redundancy increases and time is consumed

Engineering Contradiction:

Improvetree structure creationVSAvoidtime for manual node creation

Core Design Contradiction:

Ease of operationVSLoss of time

Solution Approach 1:

The system performs self-service by automatically generating tree nodes from the underlying data sources. When data is queried or retrieved, the tree structure is dynamically constructed based on the foreign key relationships without requiring manual node entry. This automatic node generation eliminates redundant manual input and significantly reduces time consumption while maintaining ease of operation.

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The foreign key relationships are pre-established in the data sources during data entry, preparing the hierarchical structure information in advance. This preliminary action allows the tree structure to be automatically generated when needed, eliminating the need for manual node creation and reducing both time and redundancy.

Inventive Principle:

Principle #10Preliminary action

4Adaptability or versatility

If hierarchical data is stored in separate structures, then data can be organized, but computing resources are wasted

Engineering Contradiction:

Improvedata organizationVSAvoidstorage structure complexity

Core Design Contradiction:

Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent combines multiple storage structures into a unified approach where data and relationship information coexist in the same tables. This merging eliminates the complexity of maintaining separate hierarchical structures while preserving effective data organization capabilities through foreign key relationships.

Inventive Principle:

Principle #5Merging (Combining)

Data Source

PatentUS9400814B2Hierarchy nodes derived based on parent/child foreign key and/or range values on parent node

Publication Date: 2016.07.26 ORACLE INT CORP

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.