Binary Edge Labeled Trees for Hierarchical Data Manipulation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Manipulating complex hierarchical data representations, such as those found in relational databases, is computationally complex and cumbersome, necessitating the development of more efficient techniques for operating on these data structures.

Innovation Solution

The use of binary edge labeled trees (BELTs) and their enumeration methods, which transform complex hierarchical data into numerical representations that can be manipulated using multiplication and table lookups, allowing for efficient operations like merging and splitting of data hierarchies, as well as ordering and hashing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If complex hierarchical data representations are manipulated using traditional graph operations, then the data relationships are preserved, but the computational complexity increases and operations become cumbersome

Engineering Contradiction:

Improveease of manipulationVSAvoidcomputational complexity

Core Design Contradiction:

Ease of operationVSDevice complexity

Solution Approach 1:

The patent replaces complex graph-based mechanical operations with numerical computations. Hierarchical data structures are transformed into numerical representations where graph operations (merging, splitting, ordering) are substituted with arithmetic operations (multiplication, division, modulo) and table lookups, dramatically reducing computational complexity while preserving data relationships

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The invention changes the parameter representation of hierarchical data from graphical/structural parameters to numerical parameters. By encoding hierarchical relationships as numbers and using mathematical operations to manipulate these numbers, the system achieves simpler computations while maintaining the integrity of data relationships

Inventive Principle:

Principle #35Parameter changes

2Reliability

If hierarchical data is represented in a detailed structural format, then data relationships are accurately captured, but data manipulation becomes computationally intensive

Engineering Contradiction:

Improvedata relationship accuracyVSAvoidoperation efficiency

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The patent substitutes detailed structural graph operations with efficient numerical computations. By representing hierarchical data as numbers and using arithmetic operations instead of graph traversals and manipulations, the system maintains accurate data relationships while significantly improving operation efficiency and productivity

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

3Reliability

If traditional graph operations are used for merging and splitting hierarchical data, then data integrity is maintained, but the operations are cumbersome and time-consuming

Engineering Contradiction:

Improvedata integrityVSAvoidoperation time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The invention replaces time-consuming graph-based merging and splitting operations with fast numerical computations. By using multiplication and division operations on numerical representations, the system maintains data integrity while reducing operation time significantly compared to traditional graph manipulation methods

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS12013829B2Manipulation and/or analysis of hierarchical data

Publication Date: 2024.06.18 LOWER48 IP LLC

AI summary

Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed.