Presentation is loading. Please wait.

Presentation is loading. Please wait.

Renovating Blockchain with Distributed Database: An Open Source System

Similar presentations


Presentation on theme: "Renovating Blockchain with Distributed Database: An Open Source System"— Presentation transcript:

1 Renovating Blockchain with Distributed Database: An Open Source System
Source: Future Generation Computer Systems, Vol. 90, No. 9, pp , Jan. 2019 Author: Muhammad Muzammal, Qiang Qu, and Bulat Nasrulin Speaker: Ren-Kai Yang Date: 04/11/2019

2 Outline Introduction Related Works Proposed Scheme
Performance Evaluation Conclusions

3 Quick Query Processing
Introduction CHAINSQL Blockchain Distributed Database Advantage Immutable High Throughput Quick Query Processing Disadvantage Low Throughput Deficient in Search Reliability Blockchain Distributed Database = Immutable + High Throughput + Quick Query Processing

4 Related Works(1/4) - Distributed Database
ID Name Location 01 Alice Taipei 02 Bob ID Name Location 01 Alice Taipei 02 Bob 03 Carol Kaohsiung 04 David ID Name Location 03 Carol Kaohsiung 04 David

5 Related Works(2/4) - Blockchain
Overview of the Blockchain

6 Related Works(3/4) - Blockchain(Cryptography & Validation)
Asymmetric cryptography Achieve Integrity Non-Forgeability Non-Repudiation OK Hash Function

7 Related Works(4/4) - Blockchain(Network & Consensus & Datastore)
P2P Network Consensus & Datastore Partial Synchrony Process Reliability Algorithm(i.e. Proof-of Work, Proof-of-Stake) PoS: $20 $30 $25 $15 $10

8 Proposed Scheme(1/7) Overview of the CHAINSQL

9 Proposed Scheme(2/7) Flowchart

10 Proposed Scheme(3/7) Usera tx1 tx2 tx3 tx4 tx5 tx6 tx7 Userb Usere
Consensus Algorithm Usera tx1 tx2 tx3 tx4 tx5 tx6 tx7 Userb Usere Userc Userd

11 Proposed Scheme(4/7) tx1: 1 tx2: 1 tx3: 1 tx4: 1 tx5: 1 Round 1 Usera
Unique Node List (UNL) Addressa Addressb Addressc Addressd Addresse tx1: 1 tx2: 1 tx3: 1 tx4: 1 tx5: 1 Round 1 Usera tx1: 1 tx2: 1 tx3: 1 tx1: 1 tx2: 1 tx3: 1 tx4: 1 Userb Usere tx1 tx2 tx3 tx4 tx5 tx6 tx7 tx1: 1 tx2: 1 tx3: 1 tx1: 1 tx2: 1 tx3: 1 tx4: 1 tx5: 1 tx6: 1 tx7: 1 Userd Userc

12 Proposed Scheme(5/7) tx1: 5 tx2: 5 tx3: 5 tx4: 3 tx5: 2 tx6: 1 tx7: 1
Round 1 (cont.) Usera Threshold = 2.5 tx1: 5 tx2: 5 tx3: 5 tx4: 3 tx5: 2 tx6: 1 tx7: 1 tx1: 5 tx2: 5 tx3: 5 tx4: 3 tx5: 2 tx6: 1 tx7: 1 Userb Usere tx1 tx2 tx3 tx4 tx5 tx6 tx7 tx1: 5 tx2: 5 tx3: 5 tx4: 3 tx5: 2 tx6: 1 tx7: 1 tx1: 5 tx2: 5 tx3: 5 tx4: 3 tx5: 2 tx6: 1 tx7: 1 Userd Userc

13 Proposed Scheme(6/7) tx5: 2 tx6: 1 tx7: 1 Round 2 Usera tx5: 2 tx6: 1
Unique Node List (UNL) Addressa Addressb Addressc Addressd Addresse tx5: 2 tx6: 1 tx7: 1 Round 2 Usera tx5: 2 tx6: 1 tx7: 1 tx5: 2 tx6: 1 tx7: 1 Userb Usere tx1 tx2 tx3 tx4 tx5 tx6 tx7 tx5: 2 tx6: 1 tx7: 1 tx5: 2 tx6: 1 tx7: 1 Userd Userc

14 Proposed Scheme(7/7) tx5: 6 tx6: 5 tx7: 5 Round 2 (cont.) Usera
Threshold = 3 tx5: 6 tx6: 5 tx7: 5 tx5: 6 tx6: 5 tx7: 5 Userb Usere tx1 tx2 tx3 tx4 tx5 tx6 tx7 tx5: 6 tx6: 5 tx7: 5 tx5: 6 tx6: 5 tx7: 5 Userd Userc

15 Performance Evaluation(1/2)
Throughput vs. Number of Nodes Throughput vs. Transactions Per Proposal

16 Performance Evaluation(2/2)
Mean Latency vs. Number of User Requests Convergence Time vs. Acceptance Step

17 Conclusions Tamper-resistant Recovery backup


Download ppt "Renovating Blockchain with Distributed Database: An Open Source System"

Similar presentations


Ads by Google