Abstract
An optimized dynamic sharding algorithm, along with a cross-sharding transaction protocol, is proposed to tackle the challenges associated with the sharding mechanism in blockchain technology. These challenges include load imbalance, the complexity of verifying cross-sharding transactions, and ensuring the atomicity of such transactions. To address these issues, this paper develops a dynamic slicing algorithm utilizing a greedy strategy, which adjusts the slicing dynamically through weight calculations to achieve load balancing based on blockchain transaction data. Additionally, to resolve the atomicity and latency issues of cross-slicing transactions, it introduces an innovative cross-slicing transaction protocol and a slice migration strategy. This approach ensures the atomicity of cross-slicing transactions by incorporating a transaction locking and rollback mechanism. Experimental results indicate that this method significantly reduces transaction latency.
| Translated title of the contribution | Optimization of Blockchain Dynamic Sharding and Cross-shard Transaction Protocol Based on Greedy Strategy |
|---|---|
| Original language | Chinese (Traditional) |
| Article number | 250100133 |
| Journal | Computer Science |
| Volume | 52 |
| Issue number | 11A |
| DOIs | |
| State | Published - 15 Nov 2025 |
Fingerprint
Dive into the research topics of 'Optimization of Blockchain Dynamic Sharding and Cross-shard Transaction Protocol Based on Greedy Strategy'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver