BLOCKCHAIN BASED DATA PROCESSING METHOD AND DEVICE

• US 20200133957A1
• Filed: 12/19/2019
• Published: 04/30/2020
• Est. Priority Date: 07/14/2017
• Status: Active Grant

• Current Assignee: Advanced New Technologies Company Limited (Ant Group Co., Ltd.)
• Original Assignee: Alibaba Group Holding Ltd.
• Inventors: Wu, Hao
• Granted Patent: US 11,093,523 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

Example methods, non-transitory computer-readable medium, and systems for blockchain-based data processing are provided herein. In one example method, a blockchain network is identified, where the blockchain network includes a plurality of blocks. For each particular block of the plurality of blocks, a series of operations can be performed. An identifier of the particular block and an identifier of service data stored in the particular block are determined. A first mapping relationship is established between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block. That first mapping relationship for the particular block is then stored in a relational database. In some instances, determining the identifier of the block includes obtaining digest information of the block, computing a value based on the digest information of the block, and associating the computed value as the identifier of the particular block.

Claims

1. A computer-implemented method, comprising:

identifying a blockchain network, the blockchain network including a plurality of blocks; and

for each particular block of the plurality of blocks;

determining an identifier of the particular block;

determining an identifier of service data stored in the particular block;

establishing a first mapping relationship between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block; and

storing the first mapping relationship for the particular block in a relational database.

2. The computer-implemented method of claim 1, wherein determining the identifier of the particular block comprises:

obtaining digest information of the particular block; and

computing, using a particular algorithm, a value based on the obtained digest information of the particular block; and

associating the computed value based on the obtained digest information as the identifier of the particular block.

3. The computer-implemented method of claim 1, wherein the method further comprises:

obtaining a state value of the particular block based on the service data stored in the particular block; and

wherein establishing the first mapping relationship between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block comprises establishing a first mapping relationship between the determined identifier of the particular block, the obtained state value of the particular block, and the determined identifier of the service data stored in the particular block.

4. The computer-implemented method of claim 3, wherein the method further comprises:

establishing a second mapping relationship between the identifier of the particular block, the obtained state value of the particular block, and an identifier of a previous block to the particular block after the state value of the particular block is obtained; and

storing the second mapping relationship in a block data table.

5. The computer-implemented method of claim 4, wherein the block data table stores, for each particular block, the determined identifier of the particular block, the obtained state value of the particular block, and the determined identifier of the service data stored in the particular block, and at least one of:

a version number of the particular block, a generation time of the particular block, or a height value of the particular block.

6. The computer-implemented method of claim 1, wherein the identifier of the service data stored in the particular block comprises a hashed value of the service data.

7. The computer-implemented method of claim 1, wherein the method further comprises, for each particular block of the plurality of blocks:

establishing a third mapping relationship between the determined identifier of the service data of the particular block and the determined identifier of the particular block with the service data after determining the identifier of the service data; and

storing the third mapping relationship in a service data table.

8. The computer-implemented method of claim 7, wherein the service data table stores an identifier of the service data and an identifier of the particular block associated with the service data, and at least one of:

a version number of the service data, a service type of the service data, a digital signature in the service data, data content of the service data, or a storage status of the service data.

9. The computer-implemented method of claim 1, wherein the method further comprises:

determining an identifier of a newly generated block when the new block is generated; and

synchronously updating the relational database based on the determined identifier of the newly generated block.

10. The computer-implemented method of claim 1, wherein the method further comprises:

determining an identifier of newly generated service data when the new service data is generated;

establishing a new mapping relationship between the identifier of the newly generated service data and an identifier of a second particular block storing the new service data after the new service data is stored in the second particular block; and

synchronously updating the relational database based on the new mapping relationship.

11. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

identifying a blockchain network, the blockchain network including a plurality of blocks; and

for each particular block of the plurality of blocks;

determining an identifier of the particular block;

determining an identifier of service data stored in the particular block;

establishing a first mapping relationship between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block; and

storing the first mapping relationship for the particular block in a relational database.

12. The non-transitory, computer-readable medium of claim 11, wherein determining the identifier of the particular block comprises:

obtaining digest information of the particular block; and

computing, using a particular algorithm, a value based on the obtained digest information of the particular block; and

associating the computed value based on the obtained digest information as the identifier of the particular block.

13. The non-transitory, computer-readable medium of claim 11, wherein the operations further comprise:

obtaining a state value of the particular block based on the service data stored in the particular block;

wherein establishing the first mapping relationship between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block comprises establishing a first mapping relationship between the determined identifier of the particular block, the obtained state value of the particular block, and the determined identifier of the service data stored in the particular block;

establishing a second mapping relationship between the identifier of the particular block, the obtained state value of the particular block, and an identifier of a previous block to the particular block after the state value of the particular block is obtained; and

storing the second mapping relationship in a block data table.

14. The non-transitory, computer-readable medium of claim 13, wherein the block data table stores, for each particular block, the determined identifier of the particular block, the obtained state value of the particular block, and the determined identifier of the service data stored in the particular block, and at least one of:

a version number of the particular block, a generation time of the particular block, or a height value of the particular block.

15. The non-transitory, computer-readable medium of claim 11, wherein the identifier of the service data stored in the particular block comprises a hashed value of the service data.

16. The non-transitory, computer-readable medium of claim 11, wherein the operations further comprise, for each particular block of the plurality of blocks:

establishing a third mapping relationship between the determined identifier of the service data of the particular block and the determined identifier of the particular block with the service data after determining the identifier of the service data; and

storing the third mapping relationship in a service data table, wherein the service data table stores an identifier of the service data and an identifier of the particular block associated with the service data, and at least one of;

a version number of the service data, a service type of the service data, a digital signature in the service data, data content of the service data, or a storage status of the service data.

17. The non-transitory, computer-readable medium of claim 11, wherein the operations further comprise:

determining an identifier of a newly generated block when the new block is generated; and

synchronously updating the relational database based on the determined identifier of the newly generated block.

18. The non-transitory, computer-readable medium of claim 11, wherein the operations further comprise:

determining an identifier of newly generated service data when the new service data is generated;

establishing a new mapping relationship between the identifier of the newly generated service data and an identifier of a second particular block storing the new service data after the new service data is stored in the second particular block; and

synchronously updating the relational database based on the new mapping relationship.

19. A computer-implemented system, comprising:

one or more computers; and

one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising;

identifying a blockchain network, the blockchain network including a plurality of blocks; and

for each particular block of the plurality of blocks;

determining an identifier of the particular block;

determining an identifier of service data stored in the particular block;

establishing a first mapping relationship between the determined identifier of the particular block and the determined identifier of the service data stored in the particular block; and

storing the first mapping relationship for the particular block in a relational database.

20. The computer-implemented system of claim 19, wherein determining the identifier of the particular block comprises:

obtaining digest information of the particular block; and

computing, using a particular algorithm, a value based on the obtained digest information of the particular block; and

associating the computed value based on the obtained digest information as the identifier of the particular block.