Optimization of Blockchain Storage Architecture Based on Voronoi Diagram

Abstract

The decentralized blockchain network architecture lacks the centralized management nodes in the traditional centralized distributed network, and if a subset containing K nodes needs to be searched in order to find the nearest set of nodes for merging distributed engines to improve the communication efficiency, the computational overhead of such an operation is huge. In order to solve the problem of inefficient information communication flow caused by the lack of centralized management nodes in blockchain networks, this paper proposes a blockchain structure storage architecture optimization scheme based on Voroni graph, which can quickly determine the impact of merging distributed storage engines on information communication efficiency and thus help to optimize the blockchain distributed storage architecture. The final implementation optimizes a problem that requires searching from O(n^k) subsets of prior art to an O(n*k) search problem.