DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism
The expansion of blockchain storage has become a major problem limiting the application of blockchain. From the perspective of improving the scalability of blockchain storage, a DHT (distributed hash table)-based blockchain dual-sharding storage extension mechanism (DBDSM) is proposed. The nodes in...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-09-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/19/9635 |
| _version_ | 1797480762089406464 |
|---|---|
| author | Jindong Zhao Donghong Zhang Wenxuan Liu Xiuqin Qiu Vladimir Brusic |
| author_facet | Jindong Zhao Donghong Zhang Wenxuan Liu Xiuqin Qiu Vladimir Brusic |
| author_sort | Jindong Zhao |
| collection | DOAJ |
| description | The expansion of blockchain storage has become a major problem limiting the application of blockchain. From the perspective of improving the scalability of blockchain storage, a DHT (distributed hash table)-based blockchain dual-sharding storage extension mechanism (DBDSM) is proposed. The nodes in the network are divided into <i>m</i> DHT clusters. Each cluster includes <i>n</i> nodes, and stores 1/<i>m</i> of the transaction data, and the nodes within each cluster store part of data allocated to that cluster. In this way, node storage pressure is alleviated. Furthermore, a hybrid query mechanism has been designed to achieve efficient querying of transaction data, without changing the original state data query. Simulation results showed without changing the original state data query, that the storage space consumed by the nodes is only <i>s</i>/(<i>m</i> × <i>n</i>) of that used in the traditional method; when the number of faulty nodes in the cluster does not exceed <i>s</i> − 1, the integrity of blockchain data can still be ensured. For transaction data queries, the average number of hops was 1.99, greatly improving query efficiency in the sharded state. |
| first_indexed | 2024-03-09T22:04:44Z |
| format | Article |
| id | doaj.art-aa8037f12cc3498dae49e11f9a3f7ca4 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T22:04:44Z |
| publishDate | 2022-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-aa8037f12cc3498dae49e11f9a3f7ca42023-11-23T19:42:59ZengMDPI AGApplied Sciences2076-34172022-09-011219963510.3390/app12199635DHT-Based Blockchain Dual-Sharding Storage Extension MechanismJindong Zhao0Donghong Zhang1Wenxuan Liu2Xiuqin Qiu3Vladimir Brusic4School of Computer and Control Engineering, Yantai University, Yantai 264005, ChinaSchool of Computer and Control Engineering, Yantai University, Yantai 264005, ChinaSchool of Computer and Control Engineering, Yantai University, Yantai 264005, ChinaSchool of Computer and Control Engineering, Yantai University, Yantai 264005, ChinaSchool of Computer Science, University of Nottingham Ningbo China, Ningbo 315100, ChinaThe expansion of blockchain storage has become a major problem limiting the application of blockchain. From the perspective of improving the scalability of blockchain storage, a DHT (distributed hash table)-based blockchain dual-sharding storage extension mechanism (DBDSM) is proposed. The nodes in the network are divided into <i>m</i> DHT clusters. Each cluster includes <i>n</i> nodes, and stores 1/<i>m</i> of the transaction data, and the nodes within each cluster store part of data allocated to that cluster. In this way, node storage pressure is alleviated. Furthermore, a hybrid query mechanism has been designed to achieve efficient querying of transaction data, without changing the original state data query. Simulation results showed without changing the original state data query, that the storage space consumed by the nodes is only <i>s</i>/(<i>m</i> × <i>n</i>) of that used in the traditional method; when the number of faulty nodes in the cluster does not exceed <i>s</i> − 1, the integrity of blockchain data can still be ensured. For transaction data queries, the average number of hops was 1.99, greatly improving query efficiency in the sharded state.https://www.mdpi.com/2076-3417/12/19/9635blockchainshardingDHTKademliaoverlap storage |
| spellingShingle | Jindong Zhao Donghong Zhang Wenxuan Liu Xiuqin Qiu Vladimir Brusic DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism Applied Sciences blockchain sharding DHT Kademlia overlap storage |
| title | DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism |
| title_full | DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism |
| title_fullStr | DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism |
| title_full_unstemmed | DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism |
| title_short | DHT-Based Blockchain Dual-Sharding Storage Extension Mechanism |
| title_sort | dht based blockchain dual sharding storage extension mechanism |
| topic | blockchain sharding DHT Kademlia overlap storage |
| url | https://www.mdpi.com/2076-3417/12/19/9635 |
| work_keys_str_mv | AT jindongzhao dhtbasedblockchaindualshardingstorageextensionmechanism AT donghongzhang dhtbasedblockchaindualshardingstorageextensionmechanism AT wenxuanliu dhtbasedblockchaindualshardingstorageextensionmechanism AT xiuqinqiu dhtbasedblockchaindualshardingstorageextensionmechanism AT vladimirbrusic dhtbasedblockchaindualshardingstorageextensionmechanism |