Composite Graph Data Structure for Dynamic Hierarchical Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies struggle to efficiently manage and query dynamic hierarchical systems, as they often require static tree organization, which limits flexibility and scalability in representing and analyzing systems with changing relationships and attributes.
Innovation Solution
A composite graph data structure is introduced, comprising multiple primary nodes organized as distinct rooted trees for different states, with secondary and value nodes that can represent attributes and their values, allowing for efficient querying and traversal across various states without the need for reconfiguration of the underlying database.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If static tree organization is used to represent hierarchical systems, then data structure simplicity is maintained, but flexibility and scalability in representing dynamic relationships deteriorate
Solution Approach 1:
The patent applies dynamics by transforming the static tree structure into a dynamic one where nodes can change parents and relationships can be modified over time. The system maintains tree-like hierarchical relationships but allows these relationships to evolve, enabling the data structure to adapt to changing system states while preserving the beneficial simplicity of tree organization.
Solution Approach 2:
The patent creates a universal data structure that can represent multiple different hierarchical states and relationship types within a single framework. This multi-functional structure can handle various query types (ancestors, descendants, siblings, cousins) and accommodate different tree configurations without requiring separate data structures for each scenario.
2Adaptability or versatility
If dynamic hierarchical systems are represented with flexible data structures, then adaptability to changing relationships is improved, but data structure complexity increases
Solution Approach 1:
The patent segments the complex dynamic hierarchical data into manageable components including ancestor information, descendant information, and relationship metadata. By dividing the data structure into discrete, well-defined segments, the system achieves high adaptability while controlling complexity through modular organization and clear separation of concerns.
3Reliability
If multiple tree structures are maintained for different system states, then representation accuracy is improved, but storage requirements and computation costs increase
Solution Approach 1:
The patent merges multiple tree representations into a single integrated dynamic hierarchical structure. Instead of maintaining separate trees for different states, the system combines them into one structure that can represent multiple states through node relationships and metadata, thereby reducing storage requirements while preserving representation accuracy.
Solution Approach 2:
The patent implements a nested structure where hierarchical levels are organized within each other, allowing efficient storage of ancestor-descendant relationships. This nesting approach enables the system to represent complex multi-state hierarchies in a compact form, reducing the overall storage footprint while maintaining accurate representation of all states.
4Loss of information
If inheritance paths are traversed for queries in dynamic hierarchies, then query completeness is improved, but query response time may be affected
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing ancestor and descendant information in the data structure. This advance preparation allows queries to retrieve pre-computed results without performing complete traversals at query time, thereby maintaining query completeness while significantly reducing response time.
Data Source
AI summary
Methods and apparatus are disclosed for representing a dynamic hierarchical system as a composite graph data structure. Members of a system are represented as primary nodes of a tree. Multiple system states have respective trees, which can be overlaid to obtain a composite graph. The composite graph can be augmented with secondary nodes for member attributes, and further nodes for state-dependent values of the attributes. Methods of processing bottom-up, top-down, and filtered queries are disclosed. Applications to military, manufacturing, and communication networks are provided.