Improving query processing in blockchain systems by using a multi-level sharding mechanism
محفوظ في:
| الحاوية / القاعدة: | The Journal of Supercomputing vol. 80, no. 10 (Jul 2024), p. 15066 |
|---|---|
| المؤلف الرئيسي: | |
| مؤلفون آخرون: | , |
| منشور في: |
Springer Nature B.V.
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | Citation/Abstract Full Text Full Text - PDF |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3256589561 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 0920-8542 | ||
| 022 | |a 1573-0484 | ||
| 024 | 7 | |a 10.1007/s11227-024-06037-5 |2 doi | |
| 035 | |a 3256589561 | ||
| 045 | 2 | |b d20240701 |b d20240731 | |
| 100 | 1 | |a Matani, Alemeh |u Islamic Azad University, Department of Computer Engineering, South Tehran Branch, Tehran, Iran (GRID:grid.411463.5) (ISNI:0000 0001 0706 2472) | |
| 245 | 1 | |a Improving query processing in blockchain systems by using a multi-level sharding mechanism | |
| 260 | |b Springer Nature B.V. |c Jul 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a With the distributed and decentralized nature of blockchain, and with its sequential data access, query processing emerges as a challenging issue in the blockchain systems. These features hinder efficient query processing and make it difficult to guarantee the validity and privacy-preserving of query results. Several solutions have been proposed to tackle the efficiency, reliability, and privacy challenges of query processing in blockchain systems. There has been rarely a comprehensive solution addressing all of these issues. In addition, the existing solutions often assume that the blockchain nodes are homogeneous in terms of their capabilities and available resources, while the blockchain nodes can have heterogeneous computational, communication, and storage resources, and can also contribute to the blockchain network in different manners. This work, considering the heterogeneity of network nodes, introduces a multi-level and score-based sharding solution for query processing where the nodes are organized into a hierarchical tree-like structure based on their score and store a proportion of transaction data in a DAG-based data structure resulting in an efficient query time. Additionally, the nodes reach a consensus over the query results from the bottom to the top of the hierarchical structure enabling reliable and fast query processing. The experiments conducted during the evaluation show that the efficiency of the proposed work is near that of relational databases in terms of query response time. It also provides a high validity rate taking advantage of its hierarchical consensus mechanism and preserves the privacy of query results using a delegation-based integration method where the final query result is integrated by the client’s representative. | |
| 653 | |a Data integrity | ||
| 653 | |a Validity | ||
| 653 | |a Queries | ||
| 653 | |a Data structures | ||
| 653 | |a Privacy | ||
| 653 | |a Blockchain | ||
| 653 | |a Nodes | ||
| 653 | |a Databases | ||
| 653 | |a Smart contracts | ||
| 653 | |a Workloads | ||
| 653 | |a Access control | ||
| 653 | |a Query processing | ||
| 653 | |a Digital signatures | ||
| 653 | |a Relational data bases | ||
| 653 | |a Heterogeneity | ||
| 700 | 1 | |a Sahafi, Amir |u Islamic Azad University, Department of Computer Engineering, South Tehran Branch, Tehran, Iran (GRID:grid.411463.5) (ISNI:0000 0001 0706 2472) | |
| 700 | 1 | |a Broumandnia, Ali |u Islamic Azad University, Department of Computer Engineering, South Tehran Branch, Tehran, Iran (GRID:grid.411463.5) (ISNI:0000 0001 0706 2472) | |
| 773 | 0 | |t The Journal of Supercomputing |g vol. 80, no. 10 (Jul 2024), p. 15066 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3256589561/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3256589561/fulltext/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3256589561/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch |