Radix Tree for Dynamic Data Integrity Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data structures used for static data are inefficient for storing and verifying dynamic data, requiring frequent reestablishment and resulting in high calculation costs due to constant modifications or deletions, which complicates data integrity verification in cloud storage services.
Innovation Solution
A radix tree structure is employed for storing and verifying dynamic data, where only nodes with changed values are recorded during data processing operations, utilizing a digital signature to verify data integrity by recalculating and recording values along the shortest path from leaf nodes to the root node.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional data structures for static data are used to store dynamic data, then data integrity verification is straightforward, but frequent reestablishment of data structures is required resulting in high calculation costs
Solution Approach 1:
The patent applies a dynamic radix tree data structure that automatically adapts to changing data conditions. The tree structure dynamically grows and shrinks based on data insertions and deletions, eliminating the need for frequent complete reestablishment. Nodes are created only when needed and removed when no longer required, providing both efficient dynamic data storage and maintained verification capability.
Solution Approach 2:
The data structure is segmented into hierarchical nodes (root node, intermediate nodes, and leaf nodes) that can be independently managed. This segmentation allows partial updates to the structure rather than complete reestablishment, reducing calculation costs while maintaining integrity verification through the hierarchical organization of data elements.
2Manufacturing precision
If data structures are frequently reestablished to accommodate dynamic data modifications, then data storage remains accurate, but processing speed decreases due to high calculation costs
Solution Approach 1:
The patent implements preliminary hashing of data elements to determine their placement in the radix tree structure before actual insertion. This preliminary action allows the structure to be prepared in advance for expected data modifications, enabling faster processing while maintaining storage accuracy through pre-computed hash values that guide data placement.
Solution Approach 2:
The radix tree structure changes its parameters (number of nodes, tree depth, branching factors) dynamically based on the actual data being stored. This parameter adaptation allows the structure to optimize for current data characteristics, improving processing speed while maintaining accuracy through parameter-tuned organization of data elements.
3Reliability
If all node values in the radix tree structure are recorded, then complete data verification is possible, but storage space requirements increase significantly
Solution Approach 1:
The patent extracts and stores only the essential verification information from the complete radix tree structure. Specifically, it records hash values of data elements and selective node information sufficient for verification, rather than storing all node values. This extraction maintains verification completeness while significantly reducing the quantity of stored data.
Solution Approach 2:
Instead of storing all original node values, the patent creates simplified copies containing only verification-critical information such as hash values and structural metadata. These copies are sufficient for integrity verification purposes while occupying minimal storage space, eliminating the need to store complete node value representations.
Data Source
AI summary
A method for processing and verifying remote dynamic data is provided. The method includes providing a radix tree structure having N levels, obtaining and recording N initial values for representing the empty radix tree structure, wherein all nodes at the same level are assigned an identical initial value. When performing a data processing operation to the radix tree structure, determining a first leaf node and calculating and recording the value of each node in a shortest path from the first leaf node to the root node. When performing a verification of a specific data, obtaining a second leaf node corresponding to the specific data, a sibling node of each node in a shortest path from the second leaf node to the root node, and generating a verification result according to a digital signature for verifying the root node, the value of each obtained sibling node, and the specific data.