GPartition-store: A multi-group collaborative parallel data storage mechanism for permissioned blockchain sharding

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-01-25 DOI:10.1016/j.future.2025.107731
Lin Qiu , Bo Yi , Xingwei Wang , Fei Gao , Kaimin Zhang , Yanpeng Qu , Min Huang
{"title":"GPartition-store: A multi-group collaborative parallel data storage mechanism for permissioned blockchain sharding","authors":"Lin Qiu ,&nbsp;Bo Yi ,&nbsp;Xingwei Wang ,&nbsp;Fei Gao ,&nbsp;Kaimin Zhang ,&nbsp;Yanpeng Qu ,&nbsp;Min Huang","doi":"10.1016/j.future.2025.107731","DOIUrl":null,"url":null,"abstract":"<div><div>The problem of insufficient storage space caused by the full-replication mechanism, which is commonly employed in existing blockchains, poses an obstacle to system scalability. Moreover, existing storage sharding mechanisms are confronted with the risk of data tampering by reason of the existence of Byzantine nodes. To address the above problems, the storage partition mechanisms, integrating Erasure Coding with Byzantine Fault Tolerance consensus protocol, are proposed such as BFT-Store and PartitionChain. While promising, these solutions still encounter three significant challenges. First, the substantial computational complexity associated with encoding during data storage and decoding during data recovery will impede the efficiency (e.g., latency and throughput) of the permissioned blockchain. Second, the signature schemes employed for verifying the completeness and correctness of encoded data on each node lead to massive communication over the network, thereby further limiting the system efficiency. Third, the process of system re-initialization, which necessitates the participation of all nodes, degrades the system stability. This paper proposes a Multi-group Collaborative Parallel Data Storage Mechanism for Permissioned Blockchain Sharding called GPartition-Store to alleviate the above problems, where the nodes are divided into multiple Storage Groups (SGs). First, the original block is partitioned into <span><math><mi>g</mi></math></span> sub-blocks (assuming <span><math><mi>g</mi></math></span> is the number of SGs), with each sub-block being further partitioned and encoded into smaller encoded-blocks or recovered by decoding in parallel across all SGs. Hence, the computational complexity of coding (i.e., encoding and decoding) can be decreased by about <span><math><msup><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> and <span><math><msup><mrow><mi>g</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span> times respectively. Second, the bloom filter is utilized to generate the verification proofs of the sub-blocks and encoded-block sets, which simultaneously avoids the heavy amount of transmitted messages, while liberating the requirement for dependence on any trusted third party. Third, the re-initialization process is launched exclusively within a specific SG when a node joins/quits the system or a single crashed node needs repair, thereby enhancing the system stability. Compared with the full-replication mechanism, BFT-Store and PartitionChain, the experimental results illustrate that GPartition-Store can improve the scalability, efficiency and stability of the dynamic blockchain network while maintaining the availability of the blocks.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107731"},"PeriodicalIF":6.2000,"publicationDate":"2025-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25000263","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The problem of insufficient storage space caused by the full-replication mechanism, which is commonly employed in existing blockchains, poses an obstacle to system scalability. Moreover, existing storage sharding mechanisms are confronted with the risk of data tampering by reason of the existence of Byzantine nodes. To address the above problems, the storage partition mechanisms, integrating Erasure Coding with Byzantine Fault Tolerance consensus protocol, are proposed such as BFT-Store and PartitionChain. While promising, these solutions still encounter three significant challenges. First, the substantial computational complexity associated with encoding during data storage and decoding during data recovery will impede the efficiency (e.g., latency and throughput) of the permissioned blockchain. Second, the signature schemes employed for verifying the completeness and correctness of encoded data on each node lead to massive communication over the network, thereby further limiting the system efficiency. Third, the process of system re-initialization, which necessitates the participation of all nodes, degrades the system stability. This paper proposes a Multi-group Collaborative Parallel Data Storage Mechanism for Permissioned Blockchain Sharding called GPartition-Store to alleviate the above problems, where the nodes are divided into multiple Storage Groups (SGs). First, the original block is partitioned into g sub-blocks (assuming g is the number of SGs), with each sub-block being further partitioned and encoded into smaller encoded-blocks or recovered by decoding in parallel across all SGs. Hence, the computational complexity of coding (i.e., encoding and decoding) can be decreased by about g2 and g3 times respectively. Second, the bloom filter is utilized to generate the verification proofs of the sub-blocks and encoded-block sets, which simultaneously avoids the heavy amount of transmitted messages, while liberating the requirement for dependence on any trusted third party. Third, the re-initialization process is launched exclusively within a specific SG when a node joins/quits the system or a single crashed node needs repair, thereby enhancing the system stability. Compared with the full-replication mechanism, BFT-Store and PartitionChain, the experimental results illustrate that GPartition-Store can improve the scalability, efficiency and stability of the dynamic blockchain network while maintaining the availability of the blocks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
Self-sovereign identity framework with user-friendly private key generation and rule table Accelerating complex graph queries by summary-based hybrid partitioning for discovering vulnerabilities of distribution equipment DNA: Dual-radio Dual-constraint Node Activation scheduling for energy-efficient data dissemination in IoT Blending lossy and lossless data compression methods to support health data streaming in smart cities Energy–time modelling of distributed multi-population genetic algorithms with dynamic workload in HPC clusters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1