An efficient distributed storage strategy for blockchain

Abstract

As the blockchain technology grows, the scale of the network is becoming huger and huger, which brings us a troublesome question: how to allocate our data into each computer of a blockchain network? For example, we can store our data from one computer, until the memory space filled, and then switch to another, spending a lot of time searching in sole computer. Or we can only put a small amount of data into one computer, resulting in a huge network and plenty of transmission time. In this paper, we compute the cost of all the allocations according to the mathematical model. By studying the formula, we get the solution of balancing the search time and the space occupancy by users' input. Based on the result, we design a data allocation strategy that can decide how many data allocated to an individual computer.