An Efficient Storage Optimization Scheme for Blockchain Based on Hash Slot
Abstract: Blockchain has developed tremendously in recent years with its own features such as anonymity and immutability. The advent of the big data era has caused the size of data on blockchain systems to increase exponentially, which leads to a great challenge to the storage capacity of nodes. Therefore, this paper proposes a storage optimization scheme based on hash slot algorithm to reduce the storage volume of nodes. We propose a model to evaluate the liveness of each block and adopt different storage strategies for blocks of different liveness to reduce the storage overhead of each node and the additional communication cost when querying ledger data. With this scheme, the ledger data can be distributed more reasonably on each node according to the storage capacity of each node by allocating the hash slots using the hash slot allocation algorithm we proposed. And experiment results show that our scheme can reduce the storage volume overhead of nodes by 78% and cause negligible additional time when accessing the ledger data.
Loading