HK1248841B - Data processing method and equipment based on blockchain - Google Patents

Description

A data processing method and device based on blockchain

Technical Field

The present application relates to the fields of Internet information processing technology and computer technology, and in particular to a data processing method and device based on blockchain.

Background Art

Blockchain technology, also known as distributed ledger technology, is a distributed Internet database technology characterized by decentralization, openness, transparency, immutability, and trustworthiness.

Data storage is a key function of blockchain technology. Each block's data storage structure consists of a header and a body. The header is used to establish a chain relationship with other blocks, effectively connecting them together. The body, on the other hand, stores business data.

For example, the data header of the nth block includes the summary information of the nth block and the summary information of the n-1th block. In this way, a chain relationship between the nth block and the n-1th block is established through the summary information of the n-1th block.

The business data stored in each block's data body is typically stored in a key-value format. For example, if the business data is "user a transfers 100 yuan to user b at time T," then if this business data is stored on a block, the content stored in the block may be: transaction time (time T), transaction source address (the address corresponding to user a), transaction destination address (the address corresponding to user b), and transaction amount (100 yuan). The transaction time, transaction source address, transaction destination address, and transaction amount here can be called keys, while time T, the address corresponding to user a, the address corresponding to user b, and 100 yuan can be called the values (i.e., attribute values) corresponding to different keys.

Summary of the Invention

In view of this, the embodiments of the present application provide a blockchain-based data processing method and device for improving the transaction processing capabilities of the blockchain network, such as data analysis and data calculation.

The embodiments of this application adopt the following technical solutions:

The present invention provides a data processing method based on blockchain, including:

Determine the block identifier of each block in the blockchain network;

Determining the data identifier of each business data stored in each of the blocks;

For each of the blocks, a mapping relationship is established between the block identifier of the block and the data identifier of each of the business data stored in the block, and the mapping relationship is stored in a relational database.

The present application also provides a blockchain-based data processing device, including:

A determination unit, which determines a block identifier of each block in the blockchain network; and determines a data identifier of each business data stored in each of the blocks;

The processing unit establishes, for each of the blocks, a mapping relationship between the block identifier of the block and the data identifier of each of the business data stored in the block, and stores the mapping relationship in a relational database.

The present application also provides a blockchain-based data processing device, comprising: at least one memory and at least one processor, wherein the memory stores a program and is configured such that the at least one processor executes the following steps:

Determine the block identifier of each block in the blockchain network;

Determining the data identifier of each business data stored in each of the blocks;

For each of the blocks, a mapping relationship is established between the block identifier of the block and the data identifier of each of the business data stored in the block, and the mapping relationship is stored in a relational database.

At least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects:

The solution provided by the embodiments of the present application is based on the block identifiers of each block in the blockchain network and the data identifiers of each business data stored in each block; and for each block, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, and the mapping relationship is stored in a relational database. In this way, by converting the business data stored in the blockchain network from non-relational data to relational data and storing it in a relational database, the reliability of data storage in the blockchain network is improved. With the help of the relational database, it helps to improve the transaction processing capabilities of the blockchain network, such as data analysis and data calculation, and improve the system capabilities of the blockchain network.

BRIEF DESCRIPTION OF THE DRAWINGS

The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

FIG1 is a flow chart of a data processing method for a blockchain provided in an embodiment of the present application;

FIG2 is a schematic diagram of a table structure corresponding to a block data table provided in an embodiment of the present application;

FIG3 is a schematic diagram of a table structure corresponding to a business data table provided in an embodiment of the present application;

FIG4 is a schematic diagram of a table structure corresponding to a relational database provided in an embodiment of the present application;

FIG5 is a schematic diagram of a scenario of a blockchain-based data processing method provided in an embodiment of the present application;

FIG6 is a schematic diagram of the structure of a blockchain-based data processing device provided in an embodiment of the present application.

DETAILED DESCRIPTION

However, although the key-value method is used for data storage in the blockchain network to ensure that business data is not tampered with, the reliability of data storage is relatively low, and it is not conducive to subsequent analysis, calculation and other transactional processing of the stored business data.

A database transaction is a logical unit of operation within the database, characterized by atomicity, consistency, isolation, and persistence. It effectively ensures the ability to process data within the database, including analytical, computational, and query capabilities.

Based on this, the embodiments of the present application provide a blockchain-based data processing method and device for improving the transaction processing capabilities of the blockchain network, such as data analysis and data calculation.

To make the purpose, technical solutions, and advantages of this application more clear, the technical solutions of this application will be clearly and completely described below in conjunction with the specific embodiments of this application and the corresponding drawings. Obviously, the embodiments described are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.

Figure 1 is a schematic flow chart of a blockchain data processing method provided in an embodiment of the present application. The method may be as follows. The execution entity of the embodiment of the present application may be a blockchain node or a server corresponding to a relational database, without specific limitation here.

Step 101: Determine the block identifier of each block in the blockchain network.

In the embodiment of the present application, each block in the blockchain network may refer to a newly generated block. When determining the block identifier of such a block, such a block may not yet store business data or may already store business data; it may also refer to a generated block, which already stores business data. No specific limitation is made here.

Specifically, for each block in the blockchain network, execute:

According to the summary information of the block, the block identifier of the block is obtained.

It should be noted that the summary information of the block here may include but is not limited to: difficulty value (difficulty target of the math problem related to the block), random number (Nonce, recording the value of the answer to the math problem related to the block), etc.

After obtaining the summary information of the block, the set algorithm can be used to calculate the summary information, and the calculated result is determined as the block identifier of the blockchain.

The set algorithm here can be a hash algorithm or a SHA256 algorithm, and there is no specific limitation here.

It should be noted that the block identifier recorded in the embodiments of the present application can uniquely identify the block, that is, different blocks correspond to different block identifiers.

In the embodiment of the present application, in addition to determining the block identifier of each block, the method further includes:

According to each of the business data stored in the block, the state value of the block is obtained.

Here we can get the state value of the block based on the bucket-tree.

Specifically, first, a Merkle tree is constructed, with each business data stored in the block as the leaf node of the Merkle tree. Second, the hash value of each leaf node (i.e., each business data) is determined. Finally, the hash value of the root node of the Merkle tree is calculated upward from the leaf node. The hash value of the root node of the Merkle tree is determined as the state value of the block.

In an embodiment of the present application, the method further includes:

After obtaining the state value of the block, establishing a first correspondence between the block identifier of the block and the above;

The first corresponding relationship is stored in the block data table.

FIG2 is a schematic diagram of the table structure corresponding to the block data table provided in an embodiment of the present application.

As can be seen from Figure 2, in addition to storing the block ID, state value, and the block ID of the previous block adjacent to the block, the block data table can also store the block version number, block generation time, block height value (the height value here can be understood as the height of the block in the entire blockchain, that is, the position of the block in the entire blockchain can be determined based on the height value), etc. In this way, the block data table can be used to quickly obtain the attribute information of each block in the blockchain network.

Step 103: Determine the data identifier of each business data stored in each block.

In the embodiment of the present application, for each business data stored in each of the blocks, the following operations are performed respectively:

The data identifier of the business data is determined according to the hash value of the business data.

Here, the hash value of the business data may be obtained by performing a hash calculation on a character string corresponding to the business data, and the data identifier of the business data may be the hash value.

It should be noted that the data identifier recorded in the embodiments of the present application can uniquely identify the business data. Therefore, any information that can uniquely identify the business data can also be used as the data identifier of the business data, and no specific limitation is made here.

In an embodiment of the present application, the method further includes:

After obtaining the data identifier of the business data, establishing a second correspondence between the data identifier of the business data and the block identifier of the block in which the business data is stored;

The second corresponding relationship is stored in the business data table.

FIG3 is a schematic diagram of the table structure corresponding to the business data table provided in an embodiment of the present application.

As can be seen from Figure 3, in addition to storing the data identifier of the business data and the block identifier of the block where the business data is stored, the business data table can also store the version number of the business data, the business type of the business data, the public key of the initiator in the business data, the initiation time of the business data, the digital signature of the initiator in the business data (obtained by the initiator using the private key to sign), the data content of the business data, the storage status of the business data (that is, whether the business data is stored in the block), etc.

It should be noted that the business data recorded in step 103 may refer to business data that has been stored in the block, or may refer to business data that has not yet been stored in the block. Therefore, before the business data is stored in the block, the business data may be stored in the business data table. In this case, the storage status of the business data in the business data table may be "not stored in the block."

If the business data has been stored in the block, then when the business data is stored in the business data table, the storage status of the business data may be "stored in the block."

It should be noted that the “first” and “second” contained in the “first corresponding relationship” and “second corresponding relationship” recorded in the embodiments of the present application have no special meanings and only represent different corresponding relationships.

Step 105: For each of the blocks, a mapping relationship is established between the block identifier of the block and the data identifier of each of the business data stored in the block, and the mapping relationship is stored in a relational database.

In an embodiment of the present application, if the state value of the block is obtained in step 101, a mapping relationship can also be established between the block identifier of the block, the state value and the data identifier of each business data stored in the block, and the mapping relationship can be stored in a relational database.

FIG4 is a schematic diagram of a table structure corresponding to a relational database provided in an embodiment of the present application.

As shown in Figure 4, the table structure corresponding to the relational database includes the block identifier of the block, the block state value, and the data identifier of the business data stored in the block. The data identifier of the business data stored in the block can be a data identifier set or a data identifier list, which is not specifically limited here.

In the embodiment of the present application, establishing a mapping relationship between the block identifier of the block and the data identifier of each of the business data stored in the block can also be determined in the following manner:

According to the first corresponding relationship contained in the block data table and the second corresponding relationship contained in the business data table, based on the block identifier, a mapping relationship between the block identifier of the block and the data identifier of each business data stored in the block is established.

For example, the block data table created is shown in Table 1:

Table 1

The business data table established is shown in Table 2:

Table 2

By analyzing Table 1 and Table 2, we can determine that:

The business data with the data identifier BXMEuqJfnhC7no8n5EPXPUzyiLw21YWxAMqW6fAMpxid is stored in the block with the block identifier 6XeQRg6Ajw3rTAZddefitnmfpAKA6NspnLhm8byuvJXM;

The business data with the data identifier DnTg93xxdYiE88iRxkXrpUGfQemtL1uHs422J6RUizF1 and the business data with the data identifier DkukkEqW4iirM7waHuRh258PCpYd54QwLL8v1ATjGSP6 are stored in the block with the block identifier 5Gj5aYzepjcU3gPbFhh9VVcx9jMvsAeP2oCvzKZ4LC4B.

Based on the block identifier, a mapping relationship between the block identifier of the block and the data identifier of each business data stored in the block can be obtained, as shown in Table 3:

Table 3

In an embodiment of the present application, when a new block or new business data is generated, the block data table, business data table and relational database may be updated.

Specifically, when a new block is generated, the block identifier of the newly generated block is determined;

According to the newly generated block identifier of the block, the block data table and/or the relational database are synchronously updated.

In another embodiment of the present application, the method further includes:

When new business data is generated, determine the data identifier of the newly generated business data;

When or after storing new business data in a block, a mapping relationship is established between the data identifier of the newly generated business data and the block identifier of the stored block;

According to the mapping relationship, the business data table and/or the relational database are synchronously updated.

For example, when new business data is generated, the business data can be stored in the business data table, and then Table 2 can be updated to Table 4:

Table 4

According to the content shown in Table 4, it can be determined that the business data with the data identifier DJu65XmCsLiS7QPWfLaQpboKg2eJZtP6ZYtAsJsSGFjb has not been stored in the block.

If the business data is stored in the block, the business data will change from Table 4 to Table 5:

Table 5

According to the content shown in Table 5, it can be determined that the service data with the data identifier DJu65XmCsLiS7QPWfLaQpboKg2eJZtP6ZYtAsJsSGFjb is stored in the block with the block identifier 6Un3dbeVx21HfqZwaAZ1DgLnjTFAA7KUokRqg7pkTqcv.

Obviously, the block identified as 6Un3dbeVx21HfqZwaAZ1DgLnjTFAA7KUokRqg7pkTqcv is a newly generated block. Therefore, the content shown in the block data table (Table 1) in the embodiment of the present application will also be updated, that is, Table 6:

Table 6

After generating new blocks and new business data, the relational database can also be updated in the above manner, as shown in Table 7:

Table 7

In order to facilitate subsequent query or analysis of business data, when converting business data stored in the blockchain network from non-relational data to relational data, an index can also be established. For example, the block identifier can be used as the index in the block data table; the data identifier can be used as the index in the business data table; in the relational database, both the block identifier and the data identifier can be used as the index, and both the block identifier and the data identifier can be used as the index, and so on. No specific restrictions are given here.

The solution provided by the embodiments of the present application is based on the block identifiers of each block in the blockchain network and the data identifiers of each business data stored in each block; and for each block, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, and the mapping relationship is stored in a relational database. In this way, by converting the business data stored in the blockchain network from non-relational data to relational data and storing it in a relational database, the reliability of data storage in the blockchain network is improved. With the help of the relational database, it helps to improve the transaction processing capabilities of the blockchain network, such as data analysis and data calculation, and improve the system capabilities of the blockchain network.

FIG5 is a schematic diagram of a scenario of a blockchain-based data processing method provided in an embodiment of the present application.

As can be seen from Figure 5, by converting the business data stored in the blockchain network from non-relational data to relational data and storing it in a relational database, the reliability of data storage in the blockchain network is improved. With the help of a relational database, it helps to improve the transaction processing capabilities of the blockchain network, such as data analysis and data calculation, and improve the system capabilities of the blockchain network.

FIG6 is a schematic diagram of the structure of a blockchain-based data processing device provided in an embodiment of the present application. The data processing device includes: a determination unit 601 and a processing unit 602, wherein:

Determining unit 601, determining a block identifier of each block in the blockchain network; and determining a data identifier of each business data stored in each of the blocks;

The processing unit 602 establishes, for each of the blocks, a mapping relationship between the block identifier of the block and the data identifier of each of the business data stored in the block, and stores the mapping relationship in a relational database.

In another embodiment of the present application, the determining unit 601 determines the block identifier of each block in the blockchain network, including:

For each block in the blockchain network, execute:

According to the summary information of the block, the block identifier of the block is obtained.

In another embodiment of the present application, the data processing device further includes: a computing unit 603, wherein:

The calculation unit 603 obtains a state value of the block according to each of the business data stored in the block;

The processing unit 602 establishes a mapping relationship between the block identifier of the block and the data identifier of each business data stored in the block, including:

A mapping relationship is established between the block identifier of the block, the state value, and the data identifier of each business data stored in the block.

In another embodiment of the present application, the data processing device further includes: a first creating unit 604, wherein:

The first creation unit 604, after obtaining the state value of the block, establishes a first correspondence between the block identifier of the block, the state value, and the block identifier of a previous block adjacent to the block;

The first corresponding relationship is stored in the block data table.

In another embodiment of the present application, the determining unit 601 determines the data identifier of each service data stored in each block, including:

For each business data stored in each block, execute respectively:

The data identifier of the business data is determined according to the hash value of the business data.

In another embodiment of the present application, the data processing device further includes: a second creating unit 605, wherein:

The second creating unit 605, after obtaining the data identifier of the business data, establishes a second correspondence between the data identifier of the business data and the block identifier of the block in which the business data is stored;

The second corresponding relationship is stored in the business data table.

In another embodiment of the present application, the processing unit 602 establishes a mapping relationship between the block identifier of the block and the data identifier of each of the business data stored in the block, including:

According to the first corresponding relationship contained in the block data table and the second corresponding relationship contained in the business data table, based on the block identifier, a mapping relationship between the block identifier of the block and the data identifier of each business data stored in the block is established.

In another embodiment of the present application, the data processing device further includes: a synchronization unit 606, wherein:

The synchronization unit 606 determines the block identifier of the newly generated block when a new block is generated; and updates the block data table and/or the relational database according to the block identifier of the newly generated block.

In another embodiment of the present application, the data processing device further includes: an updating unit 607, wherein:

The updating unit 607 determines the data identifier of the newly generated business data when new business data is generated; and establishes a mapping relationship between the data identifier of the newly generated business data and the block identifier of the stored block when or after storing the new business data in the block;

According to the mapping relationship, the business data table and/or the relational database is updated.

It should be noted that the data processing device provided in the embodiments of the present application can be implemented by software or hardware, and is not specifically limited here. The data processing device converts the business data stored in the blockchain network from non-relational data to relational data and stores it in a relational database, thereby improving the reliability of data storage in the blockchain network. With the help of the relational database, it helps to improve the transaction processing capabilities of the blockchain network, such as data analysis and data calculation, and improves the system capabilities of the blockchain network.

Based on the same inventive concept, an embodiment of the present application further provides a blockchain-based data processing device, comprising: at least one memory and at least one processor, wherein the memory stores a program and is configured such that the at least one processor executes the following steps:

Determine the block identifier of each block in the blockchain network;

Determining the data identifier of each business data stored in each of the blocks;

For each of the blocks, a mapping relationship is established between the block identifier of the block and the data identifier of each of the business data stored in the block, and the mapping relationship is stored in a relational database.

In the embodiment of the present application, the processor can also execute according to the scheme recorded in the above embodiment, which will not be repeated here.

Thus, specific embodiments of the present subject matter have been described. Other embodiments are within the scope of the appended claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve the desired results. Additionally, the processes depicted in the accompanying drawings do not necessarily require the specific order shown or sequential order to achieve the desired results. In certain embodiments, multitasking and parallel processing may be advantageous.

In the 1990s, technological improvements could be clearly distinguished as either hardware improvements (for example, improvements to circuit structures like diodes, transistors, and switches) or software improvements (improvements to process flows). However, with the advancement of technology, many process flow improvements today can now be considered direct improvements to hardware circuit structures. Designers almost always create the corresponding hardware circuit structure by programming the improved process flow into the hardware circuit. Therefore, it cannot be said that a process flow improvement cannot be implemented using hardware modules. For example, a programmable logic device (PLD), such as a field programmable gate array (FPGA), is an integrated circuit whose logical function is determined by user programming. Designers can "integrate" a digital system on a PLD through their own programming, without having to hire a chip manufacturer to design and manufacture a dedicated integrated circuit chip. Moreover, nowadays, instead of manually fabricating integrated circuit chips, this programming is mostly done using "logic compiler" software. This is similar to the software compiler used when developing programs. Before compilation, the original code must also be written in a specific programming language, called a hardware description language (HDL). There is not just one HDL, but many, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art will also understand that by simply programming the method flow in one of these hardware description languages and then programming it into an integrated circuit, a hardware circuit that implements the logic method flow can be easily obtained.

The controller can be implemented in any suitable manner. For example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro)processor, logic gates, switches, application-specific integrated circuits (ASICs), programmable logic controllers, and embedded microcontrollers. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also know that in addition to implementing the controller in a purely computer-readable program code format, the controller can be implemented in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers by logically programming the method steps. Therefore, such a controller can be considered a hardware component, and the devices included therein for implementing various functions can also be considered as structures within the hardware component. Or even, the devices for implementing various functions can be considered as both software modules that implement the method and structures within the hardware component.

The systems, devices, modules, or units described in the above embodiments may be implemented by computer chips or entities, or by products having certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

For the convenience of description, the above devices are described as being divided into various units according to their functions. Of course, when implementing this application, the functions of each unit can be implemented in the same or multiple software and/or hardware.

It will be understood by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

The present invention is described with reference to the flowcharts and/or block diagrams of the methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and/or box in the flowchart and/or block diagram, as well as the combination of processes and/or boxes in the flowchart and/or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction device that implements the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

Memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and/or non-volatile memory in the form of read-only memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

Computer-readable media includes permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transitory computer-readable media (transitory media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, commodity, or apparatus that includes a series of elements includes not only those elements but also other elements not explicitly listed, or includes elements inherent to such process, method, commodity, or apparatus. In the absence of further limitations, an element defined by the phrase "comprises a ..." does not exclude the presence of other identical elements in the process, method, commodity, or apparatus that includes the element.

The present application may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communications network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

The various embodiments in this specification are described in a progressive manner. Similar parts between the various embodiments can be referred to in conjunction with each other. Each embodiment focuses on the differences between the other embodiments. In particular, the system embodiments are generally similar to the method embodiments, so the description is relatively simple. For relevant parts, refer to the description of the method embodiments.

The foregoing is merely an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

Claims (19)

1. A blockchain-based data processing method, comprising: Determine the block identifier for each block in the blockchain network; Determine the data identifier of each business data stored in each of the aforementioned blocks; For each block, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, and the mapping relationship is stored in a relational database. 2. The data processing method according to claim 1, determining the block identifier of each block in the blockchain network, including: For each of the aforementioned blocks in the blockchain network, execute the following respectively: Based on the block's digest information, the block identifier is obtained. 3. The data processing method according to claim 2, further comprising: Based on the business data stored in the block, the state value of the block is obtained; Establishing a mapping relationship between the block identifier of the block and the data identifiers of each of the business data stored in the block includes: Establish a mapping relationship between the block identifier of the block, the state value, and the data identifiers of each business data stored in the block. 4. The data processing method according to claim 3, further comprising: After obtaining the state value of the block, a first correspondence is established between the block identifier of the block, the state value, and the block identifier of the block preceding the block adjacent to the block. Store the first correspondence in the block data table. 5. The data processing method according to claim 2, determining the data identifier of each business data stored in each of the blocks, includes: For each business data stored in each of the aforementioned blocks, execute the following respectively: The data identifier of the business data is determined based on the hash value of the business data. 6. The data processing method according to claim 5, further comprising: After obtaining the data identifier of the business data, a second correspondence is established between the data identifier of the business data and the block identifier of the block in which the business data is stored; Store the second correspondence in the business data table. 7. The data processing method according to claim 4, establishing a mapping relationship between the block identifier of the block and the data identifiers of each of the business data stored in the block, includes: Based on the first correspondence contained in the block data table and the second correspondence contained in the business data table, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, based on the block identifier. The second correspondence is the correspondence between the data identifier of the business data and the block identifier of the block in which the business data is stored. 8. The data processing method according to claim 4, further comprising: When a new block is generated, determine the block identifier of the newly generated block; Based on the block identifier of the newly generated block, the block data table and/or the relational database are updated synchronously. 9. The data processing method according to claim 6, further comprising: When new business data is generated, determine the data identifier of the newly generated business data; When or after storing new business data in a block, establish a mapping relationship between the data identifier of the newly generated business data and the block identifier of the stored block; Based on the mapping relationship, the business data table and/or the relational database are updated synchronously. 10. A blockchain-based data processing device, comprising: The unit determines the block identifier of each block in the blockchain network and the data identifier of each business data stored in each block. The processing unit establishes a mapping relationship between the block identifier of each block and the data identifier of each business data stored in the block for each block, and stores the mapping relationship in a relational database. 11. The data processing device according to claim 10, wherein the determining unit determines the block identifier of each block in the blockchain network, including; For each of the aforementioned blocks in the blockchain network, execute the following respectively: Based on the block's digest information, the block identifier is obtained. 12. The data processing apparatus according to claim 11, further comprising: a computing unit, wherein: The computing unit obtains the state value of the block based on the various service data stored in the block. The processing unit establishes a mapping relationship between the block identifier of the block and the data identifiers of each piece of business data stored in the block, including: Establish a mapping relationship between the block identifier of the block, the state value, and the data identifiers of each business data stored in the block. 13. The data processing apparatus according to claim 12, further comprising: a first creation unit, wherein: After obtaining the state value of the block, the first creation unit establishes a first correspondence between the block identifier of the block, the state value, and the block identifier of the block adjacent to the block. Store the first correspondence in the block data table. 14. The data processing apparatus according to claim 11, wherein the determining unit determines the data identifier of each business data stored in each of the blocks, including: For each business data stored in each of the aforementioned blocks, execute the following respectively: The data identifier of the business data is determined based on the hash value of the business data. 15. The data processing apparatus according to claim 14, further comprising: a second creation unit, wherein: After obtaining the data identifier of the service data, the second creation unit establishes a second correspondence between the data identifier of the service data and the block identifier of the block in which the service data is stored. Store the second correspondence in the business data table. 16. The data processing apparatus according to claim 13, wherein the processing unit establishes a mapping relationship between the block identifier of the block and the data identifiers of each of the business data stored in the block, comprising: Based on the first correspondence contained in the block data table and the second correspondence contained in the business data table, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, based on the block identifier. The second correspondence is the correspondence between the data identifier of the business data and the block identifier of the block in which the business data is stored. 17. The data processing apparatus according to claim 13, further comprising: a synchronization unit, wherein: When a new block is generated, the synchronization unit determines the block identifier of the newly generated block and updates the block data table and/or the relational database according to the block identifier of the newly generated block. 18. The data processing apparatus according to claim 15, further comprising: an update unit, wherein: The update unit determines the data identifier of the newly generated business data when new business data is generated; and establishes a mapping relationship between the data identifier of the newly generated business data and the block identifier of the stored block when or after storing the new business data into a block. Update the business data table and/or the relational database according to the mapping relationship. 19. A blockchain-based data processing device, comprising: at least one memory and at least one processor, wherein the memory stores a program and is configured to execute the following steps by the at least one processor: Determine the block identifier for each block in the blockchain network; Determine the data identifier of each business data stored in each of the aforementioned blocks; For each block, a mapping relationship is established between the block identifier of the block and the data identifier of each business data stored in the block, and the mapping relationship is stored in a relational database.