Tree Compression Using Delta Mapping Table
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional tree compression methods in distributed computer environments are inefficient, requiring a large number of node visits and identifier changes, especially when dealing with high-node trees, leading to significant processing loads.
Innovation Solution
A method involving a delta table and counter to update node and parent IDs, where each node is visited only once, reducing the processing load by tracking deleted nodes and applying delta values to correct ID mismatches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the conventional method scans all entries in the tree table below a deleted node and updates parent identifiers, then the tree structure maintains referential integrity, but the processing load increases significantly with O(M×N) node visits
Solution Approach 1:
The patent segments the tree compression process by maintaining a separate mapping table that divides the relationship between original node identifiers and compressed node identifiers. This allows updates to be propagated efficiently through the mapping table rather than scanning the entire tree table for each deletion, reducing the processing load from O(M×N) to O(N) while maintaining referential integrity.
Solution Approach 2:
The patent performs preliminary action by pre-establishing the mapping table structure and relationships before compression operations. The mapping table is prepared in advance to track which original node identifiers correspond to which compressed identifiers, allowing efficient updates during compression without requiring extensive scanning and updating of the main tree table during the actual compression process.
2Ease of operation
If the conventional method updates all node identifiers below removed lines to fill gaps, then contiguous node identifier values are maintained, but the number of visited nodes increases to O(1⁄2×M×N) on average
Solution Approach 1:
The patent introduces an intermediary mapping table that acts as a mediator between the compressed tree structure and the original tree structure. This mapping table handles the complexity of identifier transformations, allowing the main tree table to maintain contiguous identifiers while the mapping table manages the gaps created by deletions. The mapping table absorbs the computational burden of tracking and updating identifier relationships.
3Quantity of substance
If M nodes are removed from a tree with N nodes, then the tree is compressed to remove unnecessary nodes, but the processing load reaches 100,000 node visits on average
Solution Approach 1:
The patent creates a copy of the tree structure's identifier relationships in the form of a mapping table. This copy allows the system to track and update identifier mappings without directly manipulating the main tree table for each deletion. The mapping table serves as a lightweight replica that captures the essential identifier relationships, enabling efficient updates during compression operations.
Data Source
AI summary
A method and system for compressing a tree with a plurality of nodes that each may be associated with a node identifier and a parent node identifier. The method may comprise for each node in the tree determining whether the current node is to be deleted, If the current node is to be deleted updating a list of deleted nodes such that the node identifier of the current node may be stored; a parameter representing a number of nodes currently having been deleted from the tree may be stored, such that the parameter is associated with the node identifier of the current node, and updating the node identifier and the parent node identifier of the current node as a function of the list of deleted nodes. Each node in the tree is visited only once.