GriDB: Scaling Blockchain Database via Sharding and Off-Chain Cross-Shard Mechanism

Zicong Hong, Song Guo, Enyuan Zhou, Wuhui Chen, Huawei Huang, Albert Y. Zomaya
{"title":"GriDB: Scaling Blockchain Database via Sharding and Off-Chain Cross-Shard Mechanism","authors":"Zicong Hong, Song Guo, Enyuan Zhou, Wuhui Chen, Huawei Huang, Albert Y. Zomaya","doi":"10.14778/3587136.3587143","DOIUrl":null,"url":null,"abstract":"\n Blockchain databases have attracted widespread attention but suffer from poor scalability due to underlying non-scalable blockchains. While blockchain sharding is necessary for a scalable blockchain database, it poses a new challenge named\n on-chain cross-shard database services.\n Each cross-shard database service (e.g., cross-shard queries or inter-shard load balancing) involves massive cross-shard data exchanges, while the existing cross-shard mechanisms need to process each cross-shard data exchange via the consensus of all nodes in the related shards (i.e., on-chain) to resist a Byzantine environment of blockchain, which eliminates sharding benefits.\n \n \n To tackle the challenge, this paper presents GriDB, the first scalable blockchain database, by designing a novel\n off-chain cross-shard mechanism\n for efficient cross-shard database services. Borrowing the idea of off-chain payments, GriDB delegates massive cross-shard data exchange to a few nodes, each of which is randomly picked from a different shard. Considering the Byzantine environment, the untrusted delegates cooperate to generate succinct proof for cross-shard data exchanges, while the consensus is only responsible for the low-cost proof verification. However, different from payments, the database services' verification has more requirements (e.g., completeness, correctness, freshness, and availability); thus, we introduce several new\n authenticated data structures\n (ADS). Particularly, we utilize consensus to extend the threat model and reduce the complexity of traditional accumulator-based ADS for verifiable cross-shard queries with a rich set of relational operators. Moreover, we study the necessity of inter-shard load balancing for a scalable blockchain database and design an off-chain and live approach for both efficiency and availability during balancing. An evaluation of our prototype shows the performance of GriDB in terms of scalability in workloads with queries and updates.\n","PeriodicalId":20467,"journal":{"name":"Proc. VLDB Endow.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proc. VLDB Endow.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14778/3587136.3587143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Blockchain databases have attracted widespread attention but suffer from poor scalability due to underlying non-scalable blockchains. While blockchain sharding is necessary for a scalable blockchain database, it poses a new challenge named on-chain cross-shard database services. Each cross-shard database service (e.g., cross-shard queries or inter-shard load balancing) involves massive cross-shard data exchanges, while the existing cross-shard mechanisms need to process each cross-shard data exchange via the consensus of all nodes in the related shards (i.e., on-chain) to resist a Byzantine environment of blockchain, which eliminates sharding benefits. To tackle the challenge, this paper presents GriDB, the first scalable blockchain database, by designing a novel off-chain cross-shard mechanism for efficient cross-shard database services. Borrowing the idea of off-chain payments, GriDB delegates massive cross-shard data exchange to a few nodes, each of which is randomly picked from a different shard. Considering the Byzantine environment, the untrusted delegates cooperate to generate succinct proof for cross-shard data exchanges, while the consensus is only responsible for the low-cost proof verification. However, different from payments, the database services' verification has more requirements (e.g., completeness, correctness, freshness, and availability); thus, we introduce several new authenticated data structures (ADS). Particularly, we utilize consensus to extend the threat model and reduce the complexity of traditional accumulator-based ADS for verifiable cross-shard queries with a rich set of relational operators. Moreover, we study the necessity of inter-shard load balancing for a scalable blockchain database and design an off-chain and live approach for both efficiency and availability during balancing. An evaluation of our prototype shows the performance of GriDB in terms of scalability in workloads with queries and updates.
GriDB:通过分片和链下跨分片机制扩展区块链数据库
区块链数据库受到广泛关注,但由于底层区块链不可扩展,其可扩展性较差。虽然区块链分片对于可扩展的区块链数据库是必要的,但它提出了一个新的挑战,即链上跨分片数据库服务。每个跨分片数据库服务(例如,跨分片查询或跨分片负载平衡)都涉及大量的跨分片数据交换,而现有的跨分片机制需要通过相关分片(即链上)中所有节点的共识来处理每个跨分片数据交换,以抵御区块链的拜占庭环境,这消除了分片的好处。为了应对这一挑战,本文提出了GriDB,第一个可扩展的区块链数据库,通过设计一种新颖的链下跨分片机制来实现高效的跨分片数据库服务。借用链下支付的思想,GriDB将大量的跨分片数据交换委托给几个节点,每个节点都是从不同的分片中随机选择的。考虑到拜占庭环境,不受信任的代表合作为跨分片数据交换生成简洁的证明,而共识只负责低成本的证明验证。但是,与支付不同的是,数据库服务的验证有更多的要求(如完整性、正确性、新鲜度、可用性);因此,我们引入了几种新的身份验证数据结构(ADS)。特别是,我们利用共识扩展了威胁模型,并降低了传统的基于累加器的ADS的复杂性,用于具有丰富关系操作符的可验证跨分片查询。此外,我们研究了可扩展区块链数据库分片间负载平衡的必要性,并在平衡期间设计了一种离线和实时方法,以提高效率和可用性。对我们的原型的评估显示了GriDB在具有查询和更新的工作负载中的可伸缩性方面的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信