| Author: | Hong, Zicong |
| Title: | Scaling blockchain via sharding |
| Advisors: | Guo, Song (COMP) |
| Degree: | Ph.D. |
| Year: | 2025 |
| Subject: | Blockchains (Databases) Computer networks Electronic data processing -- Distributed processing Hong Kong Polytechnic University -- Dissertations |
| Department: | Department of Computing |
| Pages: | xvii, 118 pages : color illustrations |
| Language: | English |
| Abstract: | As a promising solution to blockchain scalability, sharding divides blockchain nodes into small groups called shards, splitting the workload. Existing works for sharding, however, are limited by three challenges. First, cross-shard transactions multiply the overhead of blockchain sharding, since the system needs to split each cross-shard transaction into multiple sub-transactions, each of which costs a consensus round to commit. Second, the independent and random scheduling for cross-shard transactions in different shards results in numerous conflicts and aborts since their involved accounts may be modified or locked by the others before they are committed. Third, for a blockchain database, a new and popular blockchain application, it is challenging to construct a scalable blockchain database through traditional on-chain sharding. Therefore, in chapter 3, we present a new blockchain sharding schema, named layered sharding, to improve the scalability via sharding while processing the cross-shard transactions efficiently. In chapter 4, we present PROPHET, a sharding blockchain system with deterministic ordering for conflict-free transactions. In chapter 5, we propose GrIDB, the first scalable blockchain database that distributes tables to different shards and provides efficient cross-shard database services. Evaluation of the real-world datasets for blockchain shows the remarkable performance improvement of our proposed systems over existing solutions. |
| Rights: | All rights reserved |
| Access: | open access |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/13579