Blockchain Hierarchical Data Storage Migration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain-based storage systems face challenges in efficiently pruning and hierarchically storing data nodes on state Merkle trees, leading to difficulties in accurately removing history state data and retaining latest state data, which affects storage efficiency and cost optimization.
Innovation Solution
A blockchain-based hierarchical storage method that migrates data nodes with a block number interval threshold, using key-value pairs with a two-tuple of node ID and block number, to determine which nodes to migrate from higher to lower level storage based on data updates, ensuring only the latest state data is retained in higher-level storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If all data nodes on the state Merkle tree are stored in higher-level storage, then data accessibility is improved, but storage costs increase
Solution Approach 1:
The patent segments the state Merkle tree data into different levels based on block number ranges. Higher-level storage holds only recent data nodes (current and previous blocks), while lower-level storage holds historical data nodes. This segmentation allows fast access to recent data while reducing overall storage costs by moving older data to cheaper storage.
Solution Approach 2:
The patent introduces a hierarchical dimension to the storage system, organizing data nodes into multiple storage levels (L0, L1, L2, etc.) based on their block number age. This dimensional organization enables differentiated storage strategies where different data nodes reside in different storage tiers, optimizing both accessibility and cost.
2Quantity of substance
If data migration threshold is set low, then storage costs are reduced, but data accessibility deteriorates
Solution Approach 1:
The patent dynamically adjusts the data migration threshold parameter (block number difference) based on system conditions. The threshold determines when data nodes should be migrated from higher-level to lower-level storage. By optimizing this parameter, the system balances storage cost reduction with maintaining data accessibility within acceptable timeframes.
3Quantity of substance
If frequent data migration is performed, then storage optimization is improved, but system complexity increases
Solution Approach 1:
The patent implements periodic data migration based on block number thresholds rather than continuous monitoring. Data nodes are migrated when their block number difference from the current block exceeds a predefined threshold. This periodic approach optimizes storage while avoiding the complexity of continuous migration management.
Solution Approach 2:
The system automatically determines which data nodes need migration based on their block number attributes and the current block number. The migration decision logic is self-contained, requiring minimal external intervention or complex orchestration, thereby reducing system complexity while achieving storage optimization.
4Productivity
If hierarchical storage structure is implemented, then storage efficiency is improved, but data node management complexity increases
Solution Approach 1:
The patent applies different storage qualities and management approaches to different data nodes based on their characteristics (block number age). Recent data nodes are stored in higher-level storage with faster access, while older data nodes are stored in lower-level storage. This local differentiation optimizes storage efficiency without requiring uniform complex management across all data.
Solution Approach 2:
The system uses the block number parameter as the key criterion for determining data node placement and management. By changing the storage level based on the block number parameter, the system achieves efficient hierarchical storage while keeping management logic relatively simple and parameter-driven.
Data Source
AI summary
Methods, systems, and apparatuses are disclosed for blockchain-based hierarchical data storage. One method includes determining, based on a blockchain stored in a database that includes multiple levels of storage, a block number interval that includes one or more block numbers associated with data nodes included in a state Merkle tree stored in a target data storage and to be migrated to a lower level of storage with lower storage cost in response to the data nodes meeting a data migration condition, each of the data nodes is associated with a block number of a block of the blockchain where the corresponding data node is last updated, and the data nodes in the state Merkle tree are in the form of key-value pairs (KVPs), each key of the KVPs comprises a node identifier (ID) and a block number associated with the corresponding data node.