Hierarchical Data Management via Segmented Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hierarchical data management systems face inefficiencies in managing movements of elements within a database, particularly in terms of computational complexity and processing speed, especially as data size and complexity increase.
Innovation Solution
The approach involves using a hierarchy table and a file table to store data, where updates to the hierarchy structure only require modifications in the hierarchy table, independent of the file table, reducing computational complexity and processing time by avoiding the need to update entries for child elements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hierarchical data management systems update the entire hierarchy when an element moves, then data consistency is maintained, but computational complexity and processing time increase significantly
Solution Approach 1:
The patent segments the hierarchical data structure into two independent tables: a hierarchy table storing parent-child relationships and a file table storing file metadata. This segmentation allows updates to be isolated to only the necessary table (hierarchy table) rather than requiring updates across the entire hierarchical structure, thus maintaining data consistency while reducing computational complexity from O(n) to O(1).
Solution Approach 2:
The patent extracts the hierarchical relationship data from the traditional unified file system structure and places it into a separate hierarchy table. This extraction enables independent management of hierarchy updates without affecting file table entries, resolving the contradiction between maintaining consistency and reducing update complexity.
2Reliability
If traditional systems update all child element entries when a parent element moves, then hierarchical relationships are maintained, but processing speed decreases
Solution Approach 1:
By segmenting hierarchical relationships into a dedicated hierarchy table with parent_id and element_id columns, the system can update only the specific parent_id value for moved elements without propagating changes to all child elements. This maintains hierarchical relationship integrity while achieving constant-time O(1) updates instead of linear-time O(n) updates.
Solution Approach 2:
The patent creates a simplified copy of hierarchical relationships in the hierarchy table that references files in the file table. When elements move, only the hierarchy table copy needs updating, not the actual file entries, thus maintaining relationship integrity while dramatically improving processing speed.
3Quantity of substance
If hierarchical data structures grow in size and complexity, then more data can be managed, but computational power requirements increase
Solution Approach 1:
The patent divides the hierarchical data management system into two separate tables with distinct responsibilities. This segmentation ensures that operations on one table do not require processing the entire dataset, allowing the system to scale to large data volumes while maintaining constant-time complexity O(1) for move operations, thus preventing computational power requirements from increasing with data size.
Solution Approach 2:
The patent changes the fundamental parameter of how hierarchical relationships are stored - from nested structures requiring traversal to flat tables with direct parent_id references. This parameter change enables the system to manage growing data quantities without increasing computational complexity, as updates always operate on fixed-size table rows regardless of total data volume.
Data Source
AI summary
A computer-implemented method (500, 600, 700) and a system (210) for managing data according to a hierarchical data structure. The method allows storing data associated with a path and a file, the method comprising accessing the data; for at least one of path elements associated with the data, storing, in a hierarchy table (404) (i) a hierarchy identifier; (ii) an independent hierarchy table identifier; and (iii) a parent hierarchy table identifier. For at least one of the path elements and the file associated with the data, the method stores, in a file table (402), (i) an independent file table identifier; and (ii) a parent file table identifier associated with an independent file table identifier of a parent path element from which the at least one of the path elements and the file depends.