WO2021027956A1 - Blockchain system-based transaction processing method and device - Google Patents

Abstract

A blockchain system-based transaction processing method and device. Said method comprises: a node determining a first log space corresponding to the first process when a first transaction processed by a first process is anomalous, acquiring, from the first log space, operation information of the first transaction, and performing a rollback operation on a preset database on the basis of the operation information of the first transaction. A process is to process a plurality of transactions in a serial manner, and thus by allocating different log spaces for parallel processes, the log space corresponding to each process sequentially stores operation information of the processed transaction; in this way, the node can rapidly acquire operation information of an anomalous transaction by querying the log space corresponding to the process, thereby improving the accuracy of performing rolling back on the preset database on the basis of the operation information of the anomalous transaction, and improving the accuracy of transaction processing.

Description

A transaction processing method and device based on block chain system

Cross references to related applications

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office, the application number is 201910752822.8, and the application name is "a method and device for transaction processing based on a blockchain system" on August 15, 2019. The entire content of the application is approved The reference is incorporated in this application.

Technical field

The present invention relates to the technical field of financial technology (Fintech), in particular to a transaction processing method and device based on a blockchain system.

Background technique

With the development of computer technology, more and more technologies are applied in the financial field. The traditional financial industry is gradually transforming to Fintech. Blockchain technology is no exception, but due to the security and real-time requirements of the financial industry , Also put forward higher requirements for technology. In the blockchain system, when a node processes a transaction, in addition to generating blocks based on the transaction, the transaction can also be gradually written into the transaction database set up inside the node. For example, the transaction corresponding data can be inserted and updated in the transaction database. Data corresponding to the transaction, deleting the data corresponding to the transaction, etc.

In the blockchain system, when a node executes a transaction, the transaction may be abnormal due to data errors or program failures. In order to ensure the accuracy of the transaction database, the node usually needs to roll back abnormal transactions, that is, cancel the transaction database. All write operations of this abnormal transaction restore the transaction database to the state before the abnormal transaction was executed. In an existing implementation scheme, the write log list can be preset in the node, and the write log list can be used to record all write operations performed by the node; in this way, if the transaction is found when the transaction is executed Abnormal, the node can obtain the latest write operation written in the log list and the initial write operation of the transaction, and perform the transaction database according to each write operation between the latest write operation and the initial write operation Roll back. However, in order to improve transaction processing efficiency, most of the nodes in the blockchain system at this stage support parallel processing of transactions. Therefore, the write operations of multiple transactions written to the log list may be cross-stored. Therefore, if the above implementation is adopted In this way, other transactions that are processed in parallel may be rolled back at the same time, resulting in lower accuracy of transaction processing.

In summary, there is an urgent need for a data processing method based on a blockchain system to solve the technical problem of low transaction processing accuracy when performing transaction rollbacks in the prior art.

Summary of the invention

The embodiment of the present invention provides a data processing method based on a blockchain system to solve the technical problem of low transaction processing accuracy in the prior art when performing transaction rollback.

In the first aspect, an embodiment of the present invention provides a transaction processing method based on a blockchain system. The method is applied to any node in the blockchain system and includes:

When the first transaction processed by the first process is abnormal, the node determines the first log space corresponding to the first process; wherein, the first log space is used to record that the first process is processing the transaction The operation information of the preset database; the log space allocated by the node for each parallel process is different; further, the node obtains each operation information of the first transaction from the first log space, and based on the Each operation information of the first transaction performs a rollback operation on the preset database.

In the above design, by allocating different log space for each process in parallel, each process corresponds to a log space. Because the process is based on the serial method to process multiple transactions, therefore, in the log space corresponding to the process, The operation information of the transaction is stored in sequence according to the processing order of the transaction; in this way, if the transaction currently processed by the process is abnormal, the node can quickly obtain the operation information of the abnormal transaction by querying the log space corresponding to the process, which can be based on this The operation information of abnormal transactions is accurately rolled back to the preset database to improve the accuracy of transaction processing.

In a possible design, before the first transaction processed by the first process by the node is abnormal, the method further includes: the node obtains the first log corresponding to the first process from a preset mapping table Space, and use the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction; accordingly, if the node has not obtained from the preset mapping table To the first log space corresponding to the first process, the first log space is allocated for the first process, and the correspondence between the first process and the first log space is added in all The preset mapping table.

In the above design, the corresponding relationship between the process and the log space is stored by setting the preset mapping table, so that when the node determines to use the process to process the transaction, it can directly query the preset mapping table to determine whether the corresponding log space has been allocated for the process. This can avoid allocating multiple log spaces for the same process and improve the flexibility of log space management.

In a possible design, before the node obtains the first log space corresponding to the first process from a preset mapping table, the method further includes: the node determines that the preset mapping table is in an unlocked state; The unlocked state is used to indicate that no process currently uses the preset mapping table.

In the above design, the state of the preset mapping table needs to be queried before the node uses the preset mapping table. If the preset mapping table is in an unlocked state, the node can use the preset mapping table to assign the corresponding preset mapping table to the process If the preset mapping table is locked, the node cannot use the preset mapping table; that is to say, by setting the lock resource for the preset mapping table in advance (that is, recording the state of the preset mapping table), multiple processes can be avoided Simultaneous access to the preset mapping table causes resource conflicts, and can prevent nodes from allocating the same log space for multiple processes at the same time, thereby ensuring the accuracy of transaction processing.

In a possible design, the node uses the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction, including: the node records the The initial position of the first transaction in the first log space where the first piece of operation information is located or the end position where the last operation information of the second transaction is recorded in the first log space; the second transaction is Processing the transaction processed by the first process before the first transaction; further, the node acquiring each operation information of the first transaction from the first log space includes: the node according to the first When the transaction is abnormal, the position of the latest piece of operation information in the first log space and the initial position determine each operation information of the first transaction; or, the node determines the operation information of the first transaction according to the first transaction when the first transaction is abnormal The position of the latest piece of operation information in a log space and the termination position determine each operation information of the first transaction.

In the above design, the process can record the starting position of the transaction in the log space or the ending position of the previous transaction in the log space when processing each transaction. In this way, when a certain transaction is abnormal, the current log space The operation information between the position and the starting position of the transaction in the log space or the current position in the log space and the ending position of the previous transaction in the log space are the operation information corresponding to the transaction; that is, through Record the start position of each transaction in the log space or the end position of the previous transaction in the log space, which can quickly and accurately obtain the operation information corresponding to each transaction, and improve the rollback of the preset database based on the operation information corresponding to the transaction Accuracy.

In a possible design, the method further includes: if the node determines that the first process has processed all the corresponding transactions, releasing the resources occupied by the first log space.

In the above design, after the process has processed all the corresponding transactions, by releasing the log space corresponding to the process when the process exits, the system resource occupation can be reduced and space is reserved for the log space corresponding to the subsequent process.

In the second aspect, an embodiment of the present invention provides a transaction processing device based on a blockchain system, and the device includes:

The determining module is used to determine the first log space corresponding to the first process when the first transaction processed by the first process is abnormal; wherein, the first log space is used to record the transaction processing of the first process Operation information of the preset database during the process; the log space allocated by the device for each parallel process is different;

An obtaining module, configured to obtain various operation information of the first transaction from the first log space;

The processing module is configured to perform a rollback operation on the preset database based on each operation information of the first transaction.

In a possible design, before the first transaction processed by the first process is abnormal, the determining module is further configured to: obtain the first log corresponding to the first process from a preset mapping table Correspondingly, the processing module is further configured to: use the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction; further, if the The obtaining module does not obtain the first log space corresponding to the first process from the preset mapping table, and the processing module is further configured to: allocate the first log space for the first process, and Adding the correspondence between the first process and the first log space in the preset mapping table.

In a possible design, before the obtaining module obtains the first log space corresponding to the first process from a preset mapping table, the determining module is further configured to: determine that the preset mapping table is not Locked state; the unlocked state is used to indicate that no process currently uses the preset mapping table.

In a possible design, the processing module is specifically configured to record the initial position of the first piece of operation information in the first log space of the first transaction or record the location of the second transaction in the first log space. The end position of the last piece of operation information in the log space; the second transaction is a transaction processed by the first process before the first transaction is processed; accordingly, the acquisition module is specifically configured to: When a transaction is abnormal, the position of the latest piece of operation information in the first log space and the initial position determine each operation information of the first transaction; or, the node determines the operation information of the first transaction according to the The position of the latest piece of operation information in the first log space and the termination position determine each operation information of the first transaction.

In a possible design, the processing module is further configured to: if it is determined that the first process has processed all corresponding transactions, release the resources occupied by the first log space.

In a third aspect, an embodiment of the present invention provides a computing device that includes at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the program is executed by the processing unit, The processing unit executes any transaction processing method based on the blockchain system described in the first aspect.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium that stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes the foregoing On the one hand, any transaction processing method based on the blockchain system.

These and other aspects of the present invention will be more concise and understandable in the description of the following embodiments.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings needed in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings may be obtained from these drawings without creative labor.

FIG. 1 is a schematic diagram of a flow corresponding to a transaction processing method based on a blockchain system provided by an embodiment of the present invention;

2 is a schematic diagram of the interaction flow of a transaction processing method based on a blockchain system provided by an embodiment of the present invention;

3 is a schematic structural diagram of a transaction processing device based on a blockchain system provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.

detailed description

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.

The field of financial technology (Fintech) usually involves a variety of transactions. For example, bank transactions can include card sales, deposit transactions, loan transactions, insurance transactions, wealth management transactions, etc. The daily transaction volume of banks can reach thousands or even several. Thousands of pens. With the gradual development of blockchain technology, the financial technology field can also use blockchain technology to process transactions. For example, if multiple banks are involved in related transactions, you can set up a consortium chain to synchronize related transactions. , Or you can put the courts, customers, etc. on the chain at the same time to jointly maintain the security and stability of the alliance chain.

In the blockchain system, each node can be set up with a transaction database, and each node maintains the public ledger in the blockchain system through the transaction database. The transaction database inside the node can store the transaction block processed by the node. Data and transaction data, block data can mainly include the timestamp of the start of the transaction, the hash value of the block, etc. In actual operation, the transaction database can generally be a key-value database. The key-value database is a non-relational database that can store data based on a simple key-value method. In a key-value database, each transaction data can be key-valued. The collection method is stored in a key-value database, and the key is used as a unique identifier to retrieve the corresponding value.

Table 1 is a schematic table of a possible transaction database provided by an embodiment of the present invention.

Table 1: Schematic table of a transaction database

key	value
1	10
2	20
3	30

As shown in Table 1, multiple key-value pairs can be stored in the transaction database, and each key-value pair can include a key and a value corresponding to the key. For example, a key-value pair with a key of 1 corresponds to a value of 10, a key-value pair with a key of 2 corresponds to a value of 20, and a key-value pair with a key of 3 corresponds to a value of 30. Among them, each key-value pair in the transaction database can identify a certain transaction data of the transaction. For example, if the transaction is a transaction of a certain account, each income or each expenditure of the account can be used as a separate key Value pair.

In the embodiment of the present invention, the nodes in the blockchain system can perform various write operations on the internal transaction database, such as inserting a new key-value pair, modifying an existing key-value pair, and deleting an existing one. Key-value equivalence. Among them, these write operations can be performed based on the keys in the transaction database. Three possible write operations are described below:

Insert write operation

If you earn 10 at a certain time, you can insert a key-value pair with a key of 4 (or other values, according to actual needs) and a corresponding value of 10 in the transaction database shown in Table 1, and insert a write operation The corresponding operation information can be "Type: Insert, Key: 4". In this way, the updated transaction database can be as shown in Table 2:

Table 2: Schematic of a transaction database corresponding to an insert operation

key	value
1	10
2	20
3	30
4	10

Modify write operation:

Based on the transaction database shown in Table 2, if the transaction income with key 2 is modified to 40 at a certain moment, the value corresponding to the key-value pair with key 2 can be changed to 40 in the transaction database shown in Table 2. Modify The operation information corresponding to the write operation may be "type=modify, key=2, value: 40". In this way, the updated transaction database can be as shown in Table 3:

Table 3: A schematic diagram of the transaction database corresponding to a modification operation

key	value
1	10
2	40
3	30
4	10

Delete write operation:

Based on the transaction database shown in Table 3, if the transaction income with key 2 is withdrawn at a certain moment, the key-value pair with key 2 can be deleted in the transaction database shown in Table 3, and the operation information corresponding to the write operation can be deleted It can be "Type: Delete, Key: 2". In this way, the updated transaction database can be as shown in Table 4:

Table 4: A schematic diagram of the transaction database corresponding to a delete operation

key	value
1	10
3	30
4	10

In the prior art, each node can set a log list for the internal transaction database, so as to save all write operations in the log list. Based on the foregoing Tables 1 to 4, the node can record the log list shown in Table 5a in the log list, or can also record the log list shown in Table 5b in the log list, which is not specifically limited.

Table 5a: Schematic table of a possible log list

Types of	key	value
insert	4	10
modify	2	40

delete

2

To

Table 5b: Schematic table of another possible log list

Refer to Table 5a, this type of log list records the write operations of nodes to the transaction database in order from top to bottom, and each row of data is a piece of write operation information; refer to Table 5b, this type of log list It records the write operations of nodes to the transaction database in order from left to right, and each column of data is a piece of write operation information.

Using the prior art solution, when a node executes each transaction in sequence, if a certain transaction is abnormal, the node can obtain the write operation corresponding to the abnormal transaction in the order of the write operations in the log list, thereby based on the write operation of the abnormal transaction. The transaction database is rolled back by the import operation, which is no problem. However, at this stage, the nodes in the blockchain system usually process transactions in parallel, that is, there may be multiple transactions executing at the same time. In this way, the write operations of each transaction in the log list can be interspersed; for example, the log The first to fifth write operations in the list belong to the five write operations of transaction a ₁ , the sixth write operation belongs to one write operation of transaction a ₂ , and the seventh to ten write operations belong to transaction a ₁ If the transaction a ₁ is found to be abnormal when the tenth write operation is executed, the node can follow the tenth write operation to the first write operation in the log list to return to the transaction database roll. It can be seen that this rollback operation not only rolls back the write operation of the abnormal transaction a ₁ but also rolls back the write operation of the normal transaction a ₂ , resulting in an error in the transaction processing process.

Based on this, the embodiment of the present invention provides a transaction processing method based on a blockchain system, which is used to accurately roll back the write operation of an abnormal transaction, thereby improving the accuracy of transaction processing.

Fig. 1 is a schematic diagram of a process corresponding to a transaction processing method based on a blockchain system provided by an embodiment of the present invention. The method can be applied to any node in the blockchain system. The method includes:

Step 101: When the first transaction processed by the first process is abnormal, the node determines the first log space corresponding to the first process.

In the embodiment of the present invention, after any node in the blockchain system receives the transaction, it can store the transaction in the transaction pool set inside the node, and at the same time can synchronize the transaction to other nodes in the blockchain system; Correspondingly, after receiving the transaction, other nodes can store the transaction in the transaction pool set internally by other nodes. Further, when the first node to process the transaction is determined from the multiple nodes of the blockchain system, the first node can first create a process for processing the transaction. For example, if the first node supports multi-process parallel processing of transactions, Then the first node can create multiple parallel processes at the same time, and can store the corresponding relationship between the process and the transaction in the process pool, and subsequently use each process to process the corresponding transaction; if the first node supports single-process serial processing transactions, You can create a process and use it to process multiple transactions in turn. For example, if the first node receives transactions 1 to 10 at the same time, and the number of central processing unit (CPU) cores of the first node is 5 (that is, the first node supports up to 5 processes to process transactions in parallel) , the first node may create a parallel process to process b ₁ b ₅ ~; ~ ₁ the same process if the process b ₅ b processing capacity, the first node may be assigned _a transaction process b 1 and transaction 2, b ₂ of the process 3 and 4 transactions dispensing transactions, transactions for the process b ₃ to 5 and 6 transactions, transactions for the process b ₄ to 7 and 8 transactions, transactions for the process b ₅ to 9 and 10 transactions.

Further, after the first node creates parallel processes b ₁ ˜process b ₅ , it can allocate different log space for each parallel process from the memory, and the log space corresponding to each process is used to record the transaction processing of the process. Operation information on the preset database during the process; here, the preset database refers to the transaction database in the first node. The memory may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (Random Access Memory, RAM), and static random access memory (Static Random Access Memory, SRAM). , Programmable Read Only Memory (PROM), Read Only Memory (Read Only Memory, ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), magnetic memory, Disk, CD, etc. The memory is any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto. The memory in the embodiment of the present invention may also be a circuit or any other device capable of realizing a storage function for storing program instructions and/or data.

In specific implementation, the first node can set an initial storage space in the memory in advance. After each process is created, the first node can select a sub-storage with a preset amount of data from the storage space not occupied by the initial storage space. The space is used as the log space corresponding to the process. In this way, all write operations performed by the process in the process of processing transactions can be recorded in the log space corresponding to the process. Among them, the preset data amount of the sub-storage space and the size of the initial storage space can be set by those skilled in the art based on experience, or can also be set according to actual needs, and the specifics are not limited.

For example, if the initial storage space occupies the space range from 00000000 to 10000000 and the preset data volume is 00000010, after the first node creates the process b ₁ to process b ₅ , if the initial storage space is queried, the space range from 00000000 to 00000010 is determined Is occupied, you can select sub storage space 1 to sub storage space 5 from 00000010 to 10000000, and allocate sub storage space 1 to sub storage space 5 to processes b ₁ to process b _{5 respectively} ; for example, sub storage space 1 can Occupied space range 00000010～00000100, sub storage space 2 can occupy space range 00000100～00000110, sub storage space 3 can occupy space range 00000110～00001000, sub storage space 4 can occupy space range 00001000～00001010, sub storage space 5 can occupy space The range is from 00001010 to 00001100, and each sub-storage space from sub-storage space 1 to sub-storage space 5 can store a data amount of 00000010.

It should be noted that the above is only an exemplary simple description, and the range of space occupied by sub-storage space 1 to sub-storage space 5 is only for the convenience of explaining the solution, and does not constitute a limitation on the solution. In specific implementation, the space occupied by sub-storage space 1 to sub-storage space 5 can be arbitrarily selected from 00000010 to 10000000, for example, sub-storage space 1 occupies a space range of 00000010 to 00000100, and sub-storage space 2 occupies a space range of 00001010 to 00001100, sub-storage space 3 occupies a space range of 0001000 to 00001010, sub-storage space 4 can occupy a space range of 00000100 to 00000110, and sub-storage space 5 can occupy a space range of 00000110 to 000010000, which is not specifically limited.

Take the first process as an example of process b _{1. In} specific implementation, after the first node allocates sub-storage space 1 to process b ₁ , sub-storage space 1 is the log space corresponding to process b ₁ , and process b ₁ can transfer subsequent The operation information of all transactions processed is recorded in the sub-storage space 1. For example, if the process b ₁ processes transaction 1 and transaction 2 in turn, the first node can preset the process b _{1 to} process transaction 1 and transaction 2 The operation information of the database is recorded in the log space corresponding to the process b ₁ in order. So, if the process b ₁ to determine which transaction is being processed two exceptions, it can obtain information on the operation of each transaction 2 from the storage space in the sub-1.

In a possible implementation manner, in order to facilitate the query of the log space corresponding to the process, the first node may also set a preset mapping table, and use the preset mapping table to store the correspondence between the process and the log space. In a possible implementation manner, the first node can allocate the corresponding log space for the process b ₁ in the following manner: After the process b _{1 is} created, the first node can first query the preset mapping table to determine whether the preset mapping table is Contains the log space corresponding to the process b _1. If the preset mapping table contains the log space corresponding to the process b ₁ , then the first node can directly use the log space corresponding to the process b ₁ to record that the process b _{1 is} Set all operation information of the database. Correspondingly, if the log space corresponding to process b ₁ is not included in the preset mapping table, the first node may select a sub-storage space with a preset amount of data from the storage space currently unoccupied by the initial storage space as the sub-storage space corresponding to process b ₁ Log space, and the corresponding relationship between the log space corresponding to process b ₁ and process b ₁ can be added to the preset mapping table; in this way, the first node can use the log space corresponding to process b ₁ to record that process b ₁ is processing transactions All operation information of the preset database during the process.

Table 6 is a schematic table of a possible preset mapping table provided by an embodiment of the present invention.

Table 6: An illustration of a preset mapping table

Process ID	Log space
Process b 1	00000010～00000100
Process b 2	00000100～00000110
Process b 3	00000110～00001000
Process b 4	00001000～00001010
Process b 5	00001010～00001100

As shown in Table 6, the identification of the process and the start and end positions of the log space corresponding to the process can be stored in the preset mapping table. As shown in Table 6, the log space corresponding to the process b ₁ occupies the range of 00000010～00000100 The first node can store the operation information of the preset database when process b ₁ processes transaction 1 and transaction 2 in the space of 00000010～00000100; the log space corresponding to process b ₂ occupies the space in the range of 00000100～00000110 , The first node can store the operation information of the preset database when process b ₂ processes transaction 3 and transaction 4 in the space of 00000100～00000110; the log space corresponding to process b ₃ occupies the space in the range of 00000110～00001000. One node can store the operation information of the preset database when process b ₃ processes transaction 5 and transaction 6 in the space in the range of 00000110～00001000; the log space corresponding to process b ₄ occupies the space in the range of 00001000～00001010, the first node The operation information of the preset database when process b ₄ processes transactions 7 and 8 can be stored in the space of 00001000～00001010; the log space corresponding to process b ₅ occupies the space of 00001010～00001100, the first node can store process 9 b ₅ transactions and transaction processing of the default database stored in the operation information space 00001010 00001100 ~ 10 range.

It should be noted that the operation information can be stored in the form of a table in the log space, or can also be stored in other forms, which is not limited.

In the embodiment of the present invention, a preset mapping table is set to store the corresponding relationship between the process and the log space, so that when the first node determines to use the process to process the transaction, it can directly query the preset mapping table to determine whether the corresponding process has been allocated Log space, which can avoid allocating multiple log spaces for the same process and improve the flexibility of log space management.

In the above implementation, since the preset mapping table is a common resource, if multiple processes access the preset mapping table at the same time, multiple processes may need to use a competitive method to obtain the preset mapping table, resulting in the preset mapping table being in Unstable state. To solve this problem, in an example, when the first node sets the preset mapping table, it can also set lock resources for the preset mapping table; in this way, the first node obtains the log corresponding to the process b ₁ from the preset mapping table Before space, the state of the preset mapping table can also be determined according to the lock resource of the preset mapping table. If the preset mapping table is determined to be in an unlocked state, the log space corresponding to process b ₁ can be obtained. If the preset mapping table is determined to be Locked state, you can perform waiting. Among them, the lock resource may exist in the form of a table, or may also exist in the form of a graph, which is not limited.

Table 7 is a schematic table of a lock resource provided by an embodiment of the present invention, and the lock resource in Table 7 exists in a table form.

Table 7: An illustration of a lock resource

Resources	Status (unlocked or locked)
Default mapping table	Not locked

As shown in Table 7, the lock resource can include the corresponding relationship between the preset mapping table and the state of the preset mapping table. If the state of the preset mapping table is locked, it means that a certain process currently accesses the preset mapping table. In this way, other processes cannot access the preset mapping table temporarily; if the status of the preset mapping table is unlocked, it means that no process currently accesses the preset mapping table, so other processes can access the preset mapping table.

Implementation, after creating the first node in the process b _1, can first query determines the default mapping table of the state, if it is determined the preset mapping table in an unlocked state, you can query to determine whether the preset mapping table contains the process b ₁ Corresponding log space, and set the state of the preset mapping table to the locked state to prevent other processes from accessing the preset mapping table; further, when the first node obtains the log space corresponding to process b ₁ from the preset mapping table log space, or the first node has been allocated for the process corresponding to b ₁ b ₁ and the process and process b correspondence relationship storage space ₁ corresponding to the log after a preset mapping table, the first node may be a state preset mapping table Set to unlocked state. Accordingly, if it is determined the preset mapping table in a locked state, the first node may wait until a predetermined mapping table state to the unlocked state, then check to determine whether the preset mapping table contains the corresponding process b ₁ log space.

In the embodiment of the present invention, before the first node uses the preset mapping table, the state of the preset mapping table needs to be queried. If the preset mapping table is in an unlocked state, the first node can use the preset mapping table to assign corresponding processes to the process. If the preset mapping table is locked, the first node cannot use the preset mapping table; that is, by setting lock resources for the preset mapping table in advance, multiple processes can avoid accessing the preset at the same time The resource conflict caused by the mapping table can prevent the first node from allocating the same log space to multiple processes at the same time, thereby ensuring the accuracy of transaction processing.

Step 102: The first node obtains each operation information of the first transaction from the first log space.

In the embodiment of the present invention, after the first node allocates the corresponding log space for the process b ₁ , it can use the log space corresponding to the process b ₁ to record the operation information of the process b ₁ on the preset database during the transaction processing; The process b ₁ processes transactions in a serial manner. Therefore, if the process b ₁ processes multiple transactions, the operation information of the multiple transactions can be sequentially recorded in the log space according to the processing order of the transactions. Thus, if the transaction process b ₁ found in the exception processing a transaction, the first node directly from the process b ₁ log space corresponding to the acquired information on the overall operation of unusual transactions; b ₁ because the process according to the serial processing mode Therefore, the log space corresponding to the process b ₁ will not have the operation information of multiple transactions interspersed with records, which can ensure that all the operation information of the abnormal transaction is obtained, and the speed of the acquisition can be improved.

For example, if process b ₁ processes transaction 1 and transaction 2 in turn, the operation information on the preset database when processing transaction 1 includes operation information 1 and operation information 2, and the operation information on the default database when processing transaction 2 includes operation information 3. Operation information 4 and operation information 5, the log space corresponding to process b ₁ can record operation information 1, operation information 2, operation information 3, operation information 4, and operation information 5 in sequence, as shown in Table 8.

Table 8: A schematic diagram of log space corresponding to process b ₁

position	Operation information
First byte	Operation information 1
Second byte	Operation information 2

Third byte	Operation information 3
Fourth byte	Operation information 4
Fifth byte	Operation information 5

Thus, when the process of processing the transaction in the b ₁ corresponding to the operation information 2 4 2 is found to be abnormal trading transaction, the first node may log space from process b ₁ corresponding to the operation information acquiring operation information 3 and 4.

In particular embodiments, the first node acquires operation information corresponding to unusual transactions There are many ways, such correspondence between the identifier of the first node and the transaction may be recorded in the process of operation information b ₁ corresponding to log space, thus, the first After a node determines the abnormal transaction, it can obtain the operation information matching the identifier of the abnormal transaction from the log space corresponding to the process b ₁ as each operation information of the abnormal transaction. The following describes two implementation methods for obtaining operation information corresponding to abnormal transactions.

Realization method one

In one implementation, the first node in the process during process b ₁ of each transaction, the starting position may be recorded each transaction log space for the first preset operation information database resides; thus, determining a After a transaction is an abnormal transaction, the first node can obtain the location of the latest piece of operation information from the log space corresponding to process b ₁ , and can compare the position between the location of the latest piece of operation information and the start position of the abnormal transaction. Each operation information is determined as each operation information of the abnormal transaction.

It should be noted that each operation information of the abnormal transaction includes the latest piece of operation information and the operation information corresponding to the starting position of the abnormal transaction.

Based on the log space shown in Table 8, the first node will record the location of the first operation information of transaction 1 when process b ₁ is processing transaction 1. Since the first operation information of transaction 1 is operation information 1, Thus the first dot recording position in the first operation information for transactions where a first byte; Accordingly, the first node in _a transaction processing 2, the first operation information records where the transaction in process b 2 of Location, since the first piece of operation information of transaction 2 is operation information 3, the position where the first node records the first piece of operation information of transaction 2 is the third byte. In this way, if process b ₁ finds that transaction 2 is an abnormal transaction when processing operation information 4 corresponding to transaction 2, the first node can obtain the position of the current latest operation information, that is, the fourth byte, and can change the third word The operation information between the section and the fourth byte (that is, operation information 3 and operation information 4) is used as the two operation information of abnormal transaction 2.

Implementation method two

In the second implementation mode, before the process b ₁ processes each transaction, the first node can record the termination position of the last operation information of the previous transaction in the log space corresponding to the process b ₁ ; in this way, when determining a certain transaction After the abnormal transaction, the first node can obtain the location of the latest piece of operation information from the log space corresponding to the process b ₁ , and can determine each piece of operation information between the location of the latest piece of operation information and the termination position as the abnormal transaction Each operation information.

It should be noted that each operation information of the abnormal transaction includes the latest piece of operation information, but does not include the operation information corresponding to the termination position of the previous transaction of the abnormal transaction.

Based on the log space shown in Table 8, the first node can record the last operation information of the last transaction of transaction 2 (ie transaction 1) in the log space corresponding to process b ₁ before processing transaction 2 in process b ₁ Since the last operation information of transaction 1 is operation information 2, the position where the first node records the last operation information of transaction 1 is the second byte. Thus, if the process b ₁ 2 4 corresponding to the operation information found in the process of transaction by transaction 2 is abnormal, then the first node may acquire the current position of the latest operation information is located, i.e. the fourth byte, and the second word may be The operation information between the section and the fourth byte (that is, operation information 3 and operation information 4) is used as the two operation information of abnormal transaction 2.

In the embodiment of the present invention, when processing each transaction, the process can record the starting position of the transaction in the log space or the ending position of the last transaction in the log space. In this way, when a certain transaction is abnormal, the log space The operation information between the current position and the starting position of the transaction in the log space or the ending position of the previous transaction in the log space is the operation information corresponding to the abnormal transaction; that is, by recording each transaction At the starting position in the log space or the ending position of the previous transaction in the log space, the operation information corresponding to each transaction can be quickly and accurately obtained, and the accuracy of rolling back the preset database based on the operation information corresponding to the transaction can be improved.

Step 103: The first node performs a rollback operation on the preset database based on each operation information of the first transaction.

In specific implementation, based on the log space shown in Table 8, if the first node determines that the operation information 3 and the operation information 4 are the operation information of the abnormal transaction 2, it can use the operation information 4 to roll back the preset database, and then use Operation information 3 rolls back the preset database. Wherein, after the rollback of the preset database is completed, the state of the preset database is the same as the state of the preset database after the first node finishes executing the operation information 2.

Further, the first node can query the thread pool to determine whether there are still transactions unprocessed by process b ₁ in the thread pool. If it is determined that there are transactions that have not been processed by process b _{1 in the} thread pool (for example, transaction 11), the process can continue to be used b ₁ Process transaction 11, and record the operation information of the preset database in the process of processing transaction 11 in the log space corresponding to process b _1. Repeat the process from step 101 to step 103 until there is no process in the thread pool b ₁ Until unprocessed transactions.

In a possible implementation, if it is determined that there are no unprocessed transactions of process b _{1 in the} thread pool, it means that process b ₁ has processed all the corresponding transactions. In this way, the first node can release the log corresponding to process b ₁ Resources occupied by space. Based on the preset mapping table shown in Table 6, in specific implementation, the first node determines by querying table 6 that the log space corresponding to process b ₁ is 00000010～00000100. In this way, the first node can clear the initial storage space of 00000010～00000100 Data stored in the space.

In the embodiment of the present invention, after the process has processed all the corresponding transactions, by releasing the log space corresponding to the process while the process exits, the system resource occupation can be reduced and space is reserved for the log space corresponding to the subsequent process.

FIG. 2 is a schematic diagram of the interaction flow of the transaction processing method based on the blockchain system in the embodiment of the present invention. The following describes the embodiment of the present invention in detail with reference to FIG. 2.

The transaction processing method based on the blockchain system in the embodiment of the present invention involves various modules in the background, specifically including: a log space manager, a first thread, and the like. Among them, the log space manager may be a software device, and the first thread may be any thread in the nodes of the blockchain system.

Step 201: After being created by the node, the first thread sends a log space request message to the log space manager.

Here, after the node creates the first thread, it can allocate the corresponding transaction to the first thread; for example, the node can store the correspondence between the first thread and the transaction in the public thread pool, so that the first node can access the public thread by itself The pool obtains the transaction; alternatively, the node can also send the transaction to the first thread, and the first thread will store it in the internal space by itself, which is not limited.

Further, after being created by the node, the first thread may send a log space request message to the log space manager, and the log space request message may carry the identifier of the first process.

Step 202: After receiving the log space request message sent by the first thread, the log space manager obtains the state of the preset mapping table, and determines whether the preset mapping table is locked; if it is determined that the preset mapping table is locked, execute step 203. If it is determined that the preset mapping table is not locked, perform step 204.

In the embodiment of the present invention, the lock resource of the preset mapping table may be set in the log space manager, and the log space manager may query the state of the preset mapping table by accessing the lock resource of the preset mapping table. If the state is a locked state, it is determined that the preset mapping table is locked; if the state of the preset mapping table is an unlocked state, it is determined that the preset mapping table is not locked.

In step 203, the log space manager sends a waiting instruction to the first thread and monitors the state of the preset mapping table until it is determined that the preset mapping table is switched from locked to unlocked, and step 204 is executed.

In specific implementation, if it is determined that the preset mapping table is locked, it means that other processes currently access the preset mapping table. Therefore, the log space manager can send a waiting instruction to the first process, and the waiting instruction is used to inform the first process to wait for the log The wake-up message of the space manager.

Further, the log space manager can monitor the lock resource of the preset mapping table according to the preset period. For example, the lock resource of the preset mapping table can be accessed every 5s. If the status of the preset mapping table is found to be updated during a certain access process In the unlocked state, it can be determined that no other process currently accesses the preset mapping table. In this way, the log space manager can send a wake-up message to the first process.

Step 204: The log space manager locks the preset mapping table.

If the state of the preset mapping table is unlocked, it means that no other process accesses the preset mapping table at the current moment. Therefore, the log space manager can use the preset mapping table to process the log space request message of the first process. In a specific operation, the log space manager may first update the state in the lock resource of the preset mapping table to the locked state, thereby avoiding other processes accessing the preset mapping table at the same time when the first process accesses the preset mapping table.

It should be noted that if there are multiple processes accessing the preset mapping table at the same time, the first process can be the process that competes for the lock resource first, or it can be the first to send a log space request to the log space manager The progress of the message.

In step 205, the log space manager determines whether the first log space corresponding to the first thread exists in the preset mapping table, if it does not exist, execute step 206, and if it exists, execute step 207.

Here, the preset mapping table may store the corresponding relationship between the process identifier and the location information of the log space. In this way, the log space manager may query the preset mapping table according to the identifier of the first process to determine whether there is a corresponding relationship with the first process. The ID matches the log space.

Step 206: The log space manager allocates a corresponding first log space for the first thread, and stores the corresponding relationship between the first thread and the first log space in a preset mapping table.

Step 207: The log space manager releases the locked state of the preset mapping table, and registers a callback function for the first thread.

Here, after the log space manager obtains the first log space corresponding to the first thread, it can update the state in the lock resource of the preset mapping table to an unlocked state. In this way, if there are other processes waiting for the preset mapping table, Then the log space manager can wake up other processes.

Further, the callback function may be a piece of software program preset in the node, and the callback function is used to instruct the process to release the log space corresponding to the process before exiting. Correspondingly, after the log space manager registers the callback function for the first thread, the callback function can monitor the running status of the first thread in real time. If it is determined that the first thread has processed all the corresponding transactions, it can trigger the first thread to release the first log Resources occupied by space.

Step 208: The log space manager sends the location information of the first log space to the first thread.

Here, the position information of the first log space may refer to the start position and the end position of the space range occupied by the first log space in the initial storage space.

In step 209, the first thread determines whether there is an unprocessed first transaction, if it exists, execute step 210, if it does not exist, execute step 213.

In an example, the identification of the process, the identification of the transaction corresponding to the process, and the processing status of the transaction can be stored in the common thread pool, and the processing status of the transaction can be any of unprocessed, processed, and abnormal. Therefore, after receiving the location information of the corresponding log space, the first thread can query the public thread pool to determine whether there are unprocessed transactions.

Step 210: The first thread starts to execute the first transaction, and records the starting position of the first operation information of the first transaction in the first log space corresponding to the first thread or the log corresponding to the last transaction in the first thread The location where the last piece of operation information in the space is located; and, during the execution of the first transaction, the first thread uses the first log space corresponding to the first thread to record the operation on the preset database during the execution of the first transaction information.

Step 211, in the process of executing the first transaction, the first thread determines whether the first transaction is abnormal, if it is abnormal, execute step 212, and if there is no abnormality, execute step 209.

Step 212: Obtain each operation information of the first transaction from the first log space corresponding to the first thread, perform a rollback on the preset database according to the reverse order of the position of each operation information, and execute the step after the rollback is completed 209.

In specific implementation, when the first transaction is abnormal, the first thread can obtain the latest piece of operation information from the first log space corresponding to the first thread. If the first thread records the starting position of the first transaction, the first thread It can be judged whether the position of the piece of operation information is greater than or equal to the starting position, and if the position of the piece of operation information is greater than or equal to the starting position, a reverse operation can be performed on the preset database according to the piece of operation information . Further, after the reverse operation of the preset database is completed, the last piece of operation information of the piece of operation information is obtained, and it is determined whether the position of the last piece of operation information is greater than or equal to the starting position, if the position of the last piece of operation information is If it is less than the starting position, it can be determined that the rollback is completed; accordingly, if the position of the previous operation information is greater than or equal to the starting position, the reverse operation can be performed on the preset database according to the previous operation information, and This process is repeated until the position of the operation information is smaller than the starting position.

Correspondingly, if the first thread records the termination location of the previous transaction, the first thread can determine whether the location of the piece of operation information is greater than the termination location, and if the location of the piece of operation information is greater than the termination location, Then you can perform a reverse operation on the preset database according to the piece of operation information. Further, after the reverse operation of the preset database is completed, the last piece of operation information of the piece of operation information is obtained, and it is determined whether the position of the last piece of operation information is greater than the termination position, and if the position of the last piece of operation information is less than or equal to According to the termination position, the rollback can be determined to be completed; accordingly, if the location of the last operation information is greater than the termination position, the reverse operation can be performed on the preset database according to the previous operation information, and the process can be repeated until The position where the operation information is located is less than or equal to the end position.

Step 213: The first thread executes the callback function, releases the resources occupied by the first log space, and exits.

In step 207, because the log space manager registers the callback function with the first thread, the callback function monitors the state of the first process at all times. Therefore, when all transactions corresponding to the first thread are executed, the first thread can trigger the callback Function so that the callback function releases the resources occupied by the first log space corresponding to the first process. In this way, it can be ensured that the resources occupied by the first log space corresponding to the first process are released while the first process exits, thereby reducing the resource occupancy rate and improving the processing efficiency of the system.

In the foregoing embodiment of the present invention, any node in the blockchain system determines the first log space corresponding to the first process when the first transaction processed by the first process is abnormal; wherein, the first log space is used to record the first transaction. The operation information of a process on the preset database in the process of processing transactions; the log space allocated by the node for each parallel process is different; further, the node obtains each operation information of the first transaction from the first log space, and based on the first log space Each operation information of the transaction performs a rollback operation on the preset database. In the embodiment of the present invention, by allocating different log spaces for each process in parallel, each process corresponds to a log space. Since the process processes multiple transactions in a serial manner, in the log space corresponding to the process, The operation information of the transaction is stored sequentially according to the processing order of the transaction; in this way, if the transaction currently processed by the process is abnormal, the node can quickly obtain the operation information of the abnormal transaction by querying the log space corresponding to the process, which can be based on The operation information of the abnormal transaction is accurately rolled back to the preset database to improve the accuracy of transaction processing.

In view of the foregoing method flow, an embodiment of the present invention also provides a transaction processing device based on a blockchain system. The specific content of the device can be implemented with reference to the foregoing method.

Figure 3 is a schematic structural diagram of a transaction processing device based on a blockchain system provided by an embodiment of the present invention, including:

The determining module 301 is configured to determine the first log space corresponding to the first process when the first transaction processed by the first process is abnormal; wherein, the first log space is used to record that the first process is processing the transaction The operation information of the preset database during the process; the log space allocated by the device for each parallel process is different;

The obtaining module 302 is configured to obtain various operation information of the first transaction from the first log space;

The processing module 303 is configured to perform a rollback operation on the preset database based on each operation information of the first transaction.

Optionally, before the first transaction processed by the first process is abnormal by the determining module 301, the obtaining module 302 is further configured to: obtain the first log space corresponding to the first process from a preset mapping table;

The processing module 303 is further configured to: use the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction;

If the obtaining module 302 does not obtain the first log space corresponding to the first process from the preset mapping table, the processing module 303 is further configured to: allocate the first log space for the first process A log space, and the corresponding relationship between the first process and the first log space is added to the preset mapping table.

Optionally, before the obtaining module 302 obtains the first log space corresponding to the first process from a preset mapping table, the determining module 301 is further configured to:

It is determined that the preset mapping table is in an unlocked state; the unlocked state is used to indicate that no process currently uses the preset mapping table.

Optionally, the processing module 303 is specifically configured to: record the initial position of the first piece of operation information in the first log space of the first transaction or record the second transaction in the first log space The termination location where the last piece of operation information is located; the second transaction is a transaction processed by the first process before the first transaction is processed;

The acquiring module 302 is specifically configured to: determine each operation information of the first transaction according to the location of the latest piece of operation information in the first log space and the initial location when the first transaction is abnormal; or, The node determines each operation information of the first transaction according to the position of the latest piece of operation information in the first log space when the first transaction is abnormal and the termination position.

Optionally, the processing module 303 is further configured to:

If it is determined that the first process has processed all the corresponding transactions, the resources occupied by the first log space are released.

It can be seen from the foregoing that: in the foregoing embodiment of the present invention, any node in the blockchain system determines the first log space corresponding to the first process when the first transaction processed by the first process is abnormal; A log space is used to record the operation information of the first process on the preset database in the process of processing transactions; the log space allocated by the node for each parallel process is different; further, the node obtains each of the first transaction from the first log space Operation information, and roll back the preset database based on each operation information of the first transaction. In the embodiment of the present invention, by allocating different log spaces for each process in parallel, each process corresponds to a log space. Since the process processes multiple transactions in a serial manner, in the log space corresponding to the process, The operation information of the transaction is stored sequentially according to the processing order of the transaction; in this way, if the transaction currently processed by the process is abnormal, the node can quickly obtain the operation information of the abnormal transaction by querying the log space corresponding to the process, which can be based on The operation information of the abnormal transaction is accurately rolled back to the preset database to improve the accuracy of transaction processing.

Based on the same inventive concept, an embodiment of the present invention also provides a computing device, including at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the program is executed by the processing unit , So that the processing unit executes any method described in FIG. 1 or FIG. 2 above.

Referring to FIG. 4, based on the same technical concept, an embodiment of the present invention also provides a computing device for executing a method of a data processing system in any embodiment of the present invention, and may include a memory 401 and a processor 402.

The memory 401 is configured to store a computer program executed by the processor 402. The memory 401 may mainly include a program storage area and a data storage area. The program storage area may store an operating system, an application program required for at least one function, and the like; the data storage area may store data created according to the use of a computing device. The processor 402 may be a central processing unit (central processing unit, CPU), or a digital processing unit, and so on. The embodiment of the present invention does not limit the specific connection medium between the foregoing memory 401 and the processor 402. In the embodiment of the present invention, in FIG. 4, the memory 401 and the processor 402 are connected through a bus 403, and the bus 403 is represented by a thick line in FIG. 4. The connection mode between other components is only for schematic illustration, not Limited. The bus 403 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is used in FIG. 4 to represent it, but it does not mean that there is only one bus or one type of bus.

The memory 401 may be a volatile memory (volatile memory), such as a random-access memory (RAM); the memory 401 may also be a non-volatile memory (non-volatile memory), such as a read-only memory, flash Flash memory, hard disk drive (HDD) or solid-state drive (SSD), or memory 401 can be used to carry or store desired program codes in the form of instructions or data structures and can be used by Any other medium accessed by the computer, but not limited to this. The memory 401 may be a combination of the above-mentioned memories.

The processor 402 is configured to execute the data processing method based on the blockchain system provided by the embodiment of the present invention when calling the computer program stored in the memory 401.

Those skilled in the art should understand that the embodiments of the present invention may be provided as methods or computer program products. Therefore, the present invention may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

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

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

Although the preferred embodiments of the present invention have been described, those skilled in the art can make additional changes and modifications to these embodiments once they learn the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. In this way, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention is also intended to include these modifications and variations.

Claims (12)

1. A transaction processing method based on a blockchain system, characterized in that the method is applied to any node in the blockchain system, and the method includes:

   When the first transaction processed by the first process is abnormal, the node determines the first log space corresponding to the first process; wherein, the first log space is used to record that the first process is processing the transaction Operation information of the preset database; the log space allocated by the node for each parallel process is different;

   The node obtains each operation information of the first transaction from the first log space;

   The node performs a rollback operation on the preset database based on each operation information of the first transaction.
2. The method according to claim 1, characterized in that, before the first transaction processed by the first process by the node is abnormal, the method further comprises:

   The node obtains the first log space corresponding to the first process from a preset mapping table, and uses the first log space to record that the first process performs a preset process of processing the first transaction. Operating information of the database;

   If the node does not obtain the first log space corresponding to the first process from the preset mapping table, it allocates the first log space for the first process, and sets the first process The corresponding relationship with the first log space is added to the preset mapping table.
3. The method according to claim 2, wherein before the node obtains the first log space corresponding to the first process from a preset mapping table, the method further comprises:

   The node determines that the preset mapping table is in an unlocked state; the unlocked state is used to indicate that no process currently uses the preset mapping table.
4. The method according to claim 2, wherein the node uses the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction, comprising:

   The node records the initial position of the first piece of operation information of the first transaction in the first log space or records the end position of the last piece of operation information of the second transaction in the first log space; The second transaction is a transaction processed by the first process before processing the first transaction;

   The node acquiring each operation information of the first transaction from the first log space includes:

   The node determines the operation information of the first transaction according to the position of the latest piece of operation information in the first log space when the first transaction is abnormal and the initial position; or, the node determines the operation information of the first transaction according to the When the first transaction is abnormal, the position of the latest piece of operation information in the first log space and the termination position determine each operation information of the first transaction.
5. The method according to any one of claims 1 to 4, wherein the method further comprises:

   If the node determines that the first process has processed all the corresponding transactions, it releases the resources occupied by the first log space.
6. A transaction processing device based on a blockchain system, characterized in that the device includes:

   The determining module is used to determine the first log space corresponding to the first process when the first transaction processed by the first process is abnormal; wherein, the first log space is used to record the transaction processing of the first process Operation information of the preset database during the process; the log space allocated by the device for each parallel process is different;

   An obtaining module, configured to obtain various operation information of the first transaction from the first log space;

   The processing module is configured to perform a rollback operation on the preset database based on each operation information of the first transaction.
7. 7. The device according to claim 6, wherein the determining module is used to obtain the data corresponding to the first process from a preset mapping table before the first transaction processed by the first process is abnormal. The first log space;

   The processing module is further configured to: use the first log space to record the operation information of the first process on the preset database in the process of processing the first transaction;

   If the obtaining module does not obtain the first log space corresponding to the first process from the preset mapping table, the processing module is further configured to: allocate the first log for the first process Space, and add the correspondence between the first process and the first log space in the preset mapping table.
8. 8. The apparatus according to claim 7, wherein before the obtaining module obtains the first log space corresponding to the first process from a preset mapping table, the determining module is further configured to:

   It is determined that the preset mapping table is in an unlocked state; the unlocked state is used to indicate that no process currently uses the preset mapping table.
9. The device according to claim 7, wherein the processing module is specifically configured to: record the initial position of the first piece of operation information in the first log space of the first transaction or record the second transaction The termination position where the last piece of operation information in the first log space is located; the second transaction is a transaction processed by the first process before the first transaction is processed;

   The acquiring module is specifically configured to: determine each operation information of the first transaction according to the location of the latest piece of operation information in the first log space and the initial position when the first transaction is abnormal; or, The node determines each operation information of the first transaction according to the position of the latest piece of operation information in the first log space when the first transaction is abnormal and the termination position.
10. The device according to any one of claims 6 to 9, wherein the processing module is further configured to:

    If it is determined that the first process has processed all the corresponding transactions, the resources occupied by the first log space are released.
11. A computing device, characterized by comprising at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the program is executed by the processing unit, the processing unit executes the right The method according to any one of claims 1 to 5.
12. A computer-readable storage medium, characterized in that it stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes any one of claims 1 to 5 Require the described method.

Images