A blockchain shard storage model suitable for multi-view
【Author】 Zhuang, Chuxin; Dai, Qingyun; Cao, Jiangzhong
【Source】PEER-TO-PEER NETWORKING AND APPLICATIONS
【影响因子】3.488
【Abstract】Blockchain storage scalability research, mainly including large file storage and full node storage scalability, helps to enable blockchain technology to be better applied in application scenarios with large-scale data. Multi-View application scenarios in which an object is represented by multiple view information and the view information is interconnected and needs to be stored. However, the current single-view storage scheme is not applicable to multi-view, and the computation overhead of the recursion-based multisecret sharing is relatively high. Therefore, in this paper, we integrate the above two researches, and propose a blockchain shard storage model suitable for multi-view. Specifically, we first reduce the storage overhead of IPFS and the hash number stored in the blockchain using an image stitching design. We then relieve the storage pressure of full nodes using Shamir secret sharing (SSS) to divide the transaction data into shares to form n data blocks. Finally, we improve the recursion-based multisecret sharing by optimizing the polynomial construction and reducing the number of computations of the Lagrangian interpolation algorithm to reduce computation overhead. To demonstrate the feasibility and effectiveness of the proposed model, we design an Appearance Design Patent (ADP) architecture, use it as a case study, and test the performance of the proposed model through simulation experiments. The results show that our model can significantly reduce storage. Meanwhile, our model has good performance compared to other schemes and recursion-based multisecret sharing.
【Keywords】Blockchain; Shamir Secret Sharing (SSS); Multi-view; Shard storage; IPFS
【发表时间】
【收录时间】2023-01-04
【文献类型】理论模型
【主题类别】
区块链技术-核心技术-存储策略
评论