WO2019100598A1

WO2019100598A1 - Transaction processing method and device, computer equipment, and storage medium

Info

Publication number: WO2019100598A1
Application number: PCT/CN2018/075501
Authority: WO
Inventors: 刘雄文
Original assignee: 深圳壹账通智能科技有限公司
Priority date: 2017-11-23
Filing date: 2018-02-06
Publication date: 2019-05-31
Also published as: CN107886328B; CN107886328A

Abstract

A transaction processing method comprises: receiving a transaction request, acquiring a current transaction node, and transmitting the transaction request to the current transaction node for processing; upon switchover to an alternative transaction node in the same cluster as the current transaction node due to occurrence of a failure in the current transaction node, receiving a parameter of the alternative transaction node; replacing a parameter of the current transaction node with the parameter of the alternative transaction node; and a transaction server receiving a preliminary transaction processing result returned by the alternative transaction node, and performing, according to the preliminary transaction processing result, calculation to obtain a target transaction processing result.

Description

Transaction processing method, device, computer device and storage medium

Cross-reference to related applications

This application claims the priority of the Chinese Patent Application entitled "Transaction Processing Method, Apparatus, Computer Equipment and Storage Media", filed on November 23, 2017, with the application number of 2017111807520, the entire contents of which are incorporated by reference. In this application.

Technical field

The present application relates to a transaction processing method, apparatus, computer device, and storage medium.

Background technique

In a blockchain or a distributed trading system based on the PaxOS algorithm, multiple trading nodes are required to participate in the transaction, and a consensus is reached based on a certain processing strategy. There is a possibility of dynamic changes in the trading nodes participating in the transaction. For example, the trading node may not participate in the calculation of the transaction or the calculation result of the transaction, but the transaction cannot lose the availability due to the unavailability of some trading nodes. The system needs to know which trading nodes. Available, the currently solution is to initiate a transaction between the trading nodes to monitor and synchronize data and to elect a leader of the trading node from the trading node during the transaction. If there is a trading node down and the trading node of the downtime is too far behind the ongoing trading process, either the performance of the entire system is sacrificed to allow the trading node of the downtime to participate in the calculation, or the trading node of the downtime is no longer involved in the election and transaction. Considering the minimum number of nodes in a practical application is often to restart the entire system.

These methods and methods reduce the flexibility of the system. The traditional monitoring method and the data synchronization between the transaction nodes and the election mode make the load of the whole system too heavy, and the processing of the transaction nodes of the downtime is also greatly increased. The usability of the system is reduced, and the transaction performance of the entire system is also greatly reduced.

Summary of the invention

According to various embodiments disclosed herein, a transaction processing method, apparatus, computer device, and storage medium are provided.

A transaction processing method, including:

Receiving a transaction request, and acquiring a current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving when the current transaction node fails Switching parameters of the switched transaction node in the same cluster as the current transaction node;

Replace the parameters of the current trading node with the parameters of the switched trading node; and

Receiving a preliminary transaction processing result returned by the switched transaction node, and calculating a target transaction processing result according to the preliminary transaction processing result.

A blockchain transaction processing device, comprising:

a transaction request communication module, configured to receive a transaction request, and acquire a current transaction node, and send the transaction request to the current transaction node, so that the current transaction node processes the transaction request;

a node parameter communication module, configured to receive, when the current transaction node fails, a parameter of the switched transaction node that is switched after the current transaction node is in the same cluster;

a replacement module, configured to replace parameters of the current trading node with parameters of the switched trading node; and

And a processing module, configured to receive a preliminary transaction processing result returned by the switched transaction node, and calculate a target transaction processing result according to the preliminary transaction processing result.

A computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executable by the processor to cause the one or more processors to execute The following steps: receiving a transaction request, and acquiring a current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving a failure at the current transaction node And a parameter of the switched transaction node that is switched in the same cluster as the current transaction node;

One or more non-transitory computer readable instruction storage media storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of:

Details of one or more embodiments of the present application are set forth in the accompanying drawings and description below. Other features and advantages of the present invention will be apparent from the description, drawings and claims.

DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings to be used in the embodiments will be briefly described below. Obviously, the drawings in the following description are only some embodiments of the present application, Those skilled in the art can also obtain other drawings based on these drawings without any creative work.

1 is an application environment diagram of a transaction processing method in accordance with one or more embodiments.

2 is a flow diagram of a transaction processing method in accordance with one or more embodiments.

3 is a block diagram of a blockchain transaction device in accordance with one or more embodiments.

4 is a block diagram of a computer system in accordance with one or more embodiments.

Detailed ways

In order to make the technical solutions and advantages of the present application more clear, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the application and are not intended to be limiting.

Please refer to FIG. 1. FIG. 1 is an application environment diagram of a transaction processing method in an embodiment. FIG. 1 shows a transaction server, a transaction node, and a sorting server, wherein the transaction nodes may exist in a cluster manner. The transaction processing method can be applied to a blockchain or a distributed transaction system implemented based on a PaxOS algorithm.

Specifically, the transaction server may store a configuration file or a database corresponding to the transaction server, where the configuration file or the database stores the IP address and port of the transaction node, the event address and port of the transaction node. A nominal channel can be established based on the configuration file or database. The channel contains all available trading nodes. The trading server can accept the registration of new trading nodes in the channel, the logout of the original trading node, and the change of the attributes of the original trading node. In this case, since the transaction node exists in a cluster manner, the change of the attribute of the original transaction node includes two ways: one is that the current transaction node in the transaction node cluster is faulty, and the transaction is continued by the replacement transaction node. The trading node continues to work, only the address and port of the event change. The other is that the current trading node itself is down or the trading process of the current trading node is aborted or the storage process of the current trading node is aborted. In this case, the current trading node is no longer involved in subsequent transactions. The transaction server may also register a transaction processing event with each available transaction node, receive an event notification after completion of each transaction node transaction, that is, receive the preliminary transaction processing result returned by each transaction node, and summarize the preliminary transaction processing result. The target processing result is obtained, and the target processing result is stored to the sorting server. The transaction server can achieve load balancing on a cluster basis, improving availability and efficiency.

The trading node is a data result function with calculation function and storage calculation, and each transaction node joins the trust verification of the transaction server. Each transaction node exists as a master-slave node or a cluster of nodes. When performing the transaction calculation function, only one node performs the calculation function, and the other nodes are used as backups. All nodes in the transaction node share the same data storage. device. When the transaction node pulls data to the sorting server, the parameters may include the starting position of the data and the length of the data, and then the sorting server submits the data to the current node of the trading node. After the submission is completed, the trading node will sort the target transaction returned by the server. The results are stored in their own data storage device. Before the trading process of the trading node is aborted, the trading node can send an event message to the trading server, and the trading server can update the configuration file or the database. In addition, trading nodes can achieve load balancing on the basis of clusters, improving availability and efficiency.

The sorting server can receive the target transaction result of the transaction server, and sort and store the target transaction result in chronological order, so that when receiving the data acquisition request of the transaction node, the sorting server can return the correct target transaction result to the corresponding Trading node. The sorting server can provide services out of data synchronization between the cluster and the cluster, providing data persistence and high throughput performance.

In one embodiment, referring to FIG. 2, a transaction processing method is provided. This embodiment is exemplified by applying the method to the transaction server in FIG. 1 described above. The method specifically includes the following steps:

S202: Receive a transaction request, and acquire a current transaction node, and send the transaction request to the current transaction node, so that the current transaction node processes the transaction request.

Specifically, the transaction server can verify the transaction request after receiving the external transaction request, for example, the transaction server pre-arranges the encryption and decryption method and algorithm, the signing and verification method and the algorithm, and the like, and receives the transaction request at the transaction server. At the same time, the verification is first performed according to the pre-agreed verification method, and then the decryption is performed according to a predetermined decryption method to obtain transaction data and the like.

The transaction server obtains the current transaction node, which may be a transaction server query configuration file or a database, etc., wherein the transaction server may establish a channel in the configuration file or the database, and the channel may be associated with the transaction type, so that the transaction server may be based on the configuration file or the database. The attribute of the transaction node stored in the middle is acquired to the current transaction node, and the transaction request is sent to the current transaction node. Further, the transaction server may encrypt the decrypted transaction data, generate a corresponding transaction identifier, and then send the transaction identifier and the transaction data to the corresponding current transaction node, wherein the transaction identifier is an identifier that can uniquely determine the transaction. .

The transaction server may also prioritize changes to the configuration file or the database. For example, the configuration file or the database change caused by the change of the transaction node attribute has the highest priority, and the change of the configuration file or the database caused by the transaction node logout is prioritized. Secondly, the configuration file caused by the registration of the transaction node has the lowest priority, the same priority is queued in the manner of queue, and the update of the configuration file or database can only be performed by the transaction server. And the transaction server can establish the concept of the channel, the channel contains the available transaction nodes, and the channel can be associated with the transaction type. The attributes of each transaction node include the identifier of the transaction node, which can be the number of the transaction node, and the execution of the transaction node. The IP address and port of the transaction, the event address and port of the event registration for each trading node. The IP address where each transaction node executes the transaction and the address registered by the transaction node event may be the same, and the ports may be different. The properties of the trading node are recorded in the configuration file or database.

Specifically, after the current transaction node acquires the transaction request, the transaction request is processed to generate a preliminary transaction processing result. Further, the current transaction node may, after obtaining the transaction request, perform verification and decryption on the transaction request to obtain the transaction identifier and the transaction data, and process the transaction data to obtain a preliminary transaction processing result, and the preliminary transaction is obtained. The processing result is returned to the trading server.

S204: Receive parameters of the switched transaction node that is in the same cluster as the current transaction node when the current transaction node fails.

Specifically, if the current transaction node fails, the transaction node cluster can replace the current transaction node with another non-failed transaction node in the cluster, so that the transaction can continue, and since all transaction nodes in the transaction node cluster share storage Space, so that the switched trading node can continue to process the current transaction request from the location where the current trading node fails, without reprocessing, which can save a lot of processing time. And in order to realize communication with the server, after the current transaction node is switched, the transaction node cluster sends the parameters of the switched transaction node to the transaction server, so that the transaction server can change the content in the configuration file or the database, so that the transaction service can be understood in real time. To the case where the properties of the trading node change.

The transaction server may first perform event registration to each currently available transaction node and perform RPC (remote procedure call) of the event; when the attribute of the transaction node changes, the transaction server may receive the event message and receive the message. The mode can be asynchronous non-blocking, that is, the transaction server can still continue other event processing. In addition, the return of the initial transaction processing result of the transaction node is also returned to the transaction server by means of the event message. Therefore, when the transaction server receives the event message, it may first determine that the event message is a normal transaction node to complete the transaction execution according to the type of the event message. The event notification is also a failure of the transaction node itself, that is, an event message in which the transaction node itself changes. Then, if the event message is a message that the transaction node itself is faulty, it is first determined whether the message indicates that the transaction node's IP address or port, or the event address or port is transformed, and if so, processing is performed according to the corresponding processing policy.

S206: The transaction server replaces the parameter of the current transaction node with the parameter of the switched transaction node.

Specifically, after the event message received by the transaction server, the signature of the message of the event message is first validated. If it is valid, it is determined whether the IP address or port of the transaction node, or the event address or port is changed. , the configuration file or database will be updated. If not, that is, the message event is the status and execution result of the transaction node, the configuration file or database will not be updated, and the preliminary transaction processing result returned by the transaction node is saved.

S208: Receive a preliminary transaction processing result returned by the switched transaction node, and calculate a target transaction processing result according to the preliminary transaction processing result.

Specifically, after receiving the preliminary transaction processing result, the transaction server stores according to the transaction identifier, and after all the transaction nodes or a preset number of transaction nodes return the preliminary transaction processing result, the target can be obtained according to the preset processing strategy. Transaction processing results. The transaction server controls the execution of the transaction, and ensures the consistency of the transaction result based on the processing strategy. The transaction node is mainly used to complete the execution of the transaction and store the consistency processing result of the transaction, and the transaction node is related to the transaction before executing the transaction. The parameters are initialized, and the sorting server sorts and stores the consistent results after the transaction, and provides the consistent result data of the transaction according to the request of the transaction node.

The transaction processing method, if the current transaction node fails, directly switches to another transaction node in the same cluster as the current transaction node to continue processing the transaction request, and sends the parameter of the switched transaction node to the transaction server, so that the transaction server The transaction node after the switch is clearly understood, so that the transaction server can normally receive the initial transaction processing result returned by the transaction node, and does not need to monitor each transaction node in real time, thereby saving system resources and improving system performance.

In one embodiment, the transaction processing method further includes: if the transaction node in the cluster corresponding to the current transaction node fails, receiving the transaction node failure information returned by the current transaction node; and the current transaction according to the information of the transaction node failure The node marks; if the current transaction node is processing the transaction request, the preliminary transaction processing result corresponding to the current transaction node is marked as a transaction failure.

Specifically, the change of the transaction node includes three types, one is the registration of the transaction node, that is, the new transaction node is added to the system, and the other is the cancellation of the transaction node, that is, the existing transaction node exits the system, and one The change of the attributes of the transaction node, wherein the registration of the transaction node and the cancellation of the transaction node are performed by the transaction node actively sending a message to the transaction server, and the transaction server listens for and receives the message, and the transaction node attribute changes by the transaction. The server first registers the event with the available trading node, and then when the transaction node property changes, the transaction server receives the event message of the change, and the message is signed by the transaction node and checked by the transaction server, and the signature verification is passed. Processing, and the processing results need to be confirmed by the transaction server to take effect.

The change of the attributes of the transaction node includes the change of the address and port of the transaction node, the event address and the port, and the change of the transaction process, the suspension of the storage process or the change of the transaction node itself. These three changes will lead to the connection. Errors, and these three errors indicate that the trading nodes in the cluster corresponding to the current trading node have failed. When the transaction server receives these three types of errors, the current trading node is directly marked, that is, marked as unavailable. So that the trading node will no longer be used later.

In the above embodiment, when the transaction nodes in the cluster corresponding to the current transaction node all fail, the transaction node is marked, so that the transaction node is no longer used, and if the current transaction node is processing the transaction request, the token is directly marked. The preliminary transaction processing result of this transaction corresponding to the current trading node is the transaction failure, which lays a foundation for the subsequent calculation of the target transaction result.

In one embodiment, the transaction processing method may further include: if receiving the information of the current transaction node cancellation, determining whether the current transaction node is processing the transaction request; if the current transaction node is processing the transaction request, the asynchronous non-blocking After the mode continues to wait for the preliminary transaction processing result returned by the current trading node, the parameters of the current trading node are deleted.

In one embodiment, the transaction processing method may further include: if the registration information of the new transaction node is received, verifying the registration information; and when the verification is passed, adding the parameters of the new transaction node.

Specifically, when the transaction server receives the information of the transaction node cancellation, it first determines whether the current transaction node is processing the transaction request, and if so, the transaction server continues to wait for the current transaction node to return the preliminary transaction processing result through the asynchronous non-blocking mode, and then The parameters of the current trading node are deleted, so that the cancellation of the current trading node can be completed without affecting the transaction request being processed by the current trading node.

When the transaction server receives the registration information of the transaction node, it will perform verification to prevent the criminals from obtaining the transaction information by registering the transaction node. For example, the CA server can be introduced, and the CA server delivers the transaction server to the secure transaction node. The key or the certificate, the transaction node encrypts the registration information by the key, and when the transaction server receives the registration information of the transaction node, the transaction server first decrypts, and only after the decryption is passed, the transaction server completes the registration of the new transaction node according to the registration information.

In the above embodiment, when the transaction server processes the transaction, it performs different processing according to the dynamic change of the transaction node and the processing strategy. The dynamic change of the transaction node occurs before the execution of the transaction, and the latest update is obtained because the configuration file or the database is updated. The node information is traded so that the transaction request is sent to the available trading nodes for execution and the preliminary transaction processing results are obtained. If the dynamic change of the trading node occurs in the execution of the transaction, there are two cases. One is that the transaction server has sent the transaction request to all available trading nodes, and the other is that the transaction server is sending the transaction request. The end of the transaction has not been completely sent, and it is possible to decide whether to terminate the processing of the transaction request according to the processing strategy. The dynamic change of the trading node occurs after the execution of the transaction, and will not affect and change the current transaction processing result.

In one embodiment, the step of calculating the target transaction processing result according to the preliminary transaction processing result may include: determining whether the preliminary transaction processing result fed back by the current transaction node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value; If the number of successful preliminary transaction processing results is greater than or equal to the preset value, the target transaction result indicates that the transaction is successful; when the number of preliminary transaction processing results indicating that the transaction is successful is less than the preset value, the target transaction result indicates that the transaction has failed.

Specifically, after receiving the preliminary transaction processing result fed back by the transaction node, the transaction server queries the number of successful transaction results and obtains the target transaction result according to the transaction strategy.

For example, if the trading strategy is that the initial transaction processing result of all the trading nodes in the transaction server needs to indicate that the transaction is successful, then the target transaction result is the transaction success. If there is a transaction node whose initial transaction processing result indicates that the transaction is unsuccessful, the target transaction result is obtained. It is a transaction failure. Under this trading strategy, the trading server queries the preliminary transaction processing result returned by the trading node, and when all the preliminary transaction processing results indicate that the transaction is successful, the target transaction result indicating that the transaction is successful is output, when there is a preliminary transaction processing result When the transaction is failed, the result of the target transaction indicating that the transaction failed is output.

When the trading strategy is that at least n/2+1 trading nodes in the channel have a preliminary transaction processing result indicating that the transaction is successful, the target trading result is the transaction success, if there is no preliminary transaction processing of n/2+1 trading nodes The result indicates success, then the target transaction result is a transaction failure, where n is the number of trading nodes. Under this trading strategy, the transaction server queries the preliminary transaction processing result returned by the trading node, and when at least n/2+1 preliminary transaction processing results indicate that the transaction is successful, the target transaction result indicating that the transaction is successful is output, when not When there are at least n/2+1 preliminary transaction processing results indicating that the transaction is successful, a target transaction result indicating that the transaction failed is output.

In the above embodiment, the transaction server obtains the target transaction result according to the preliminary transaction processing result returned by the transaction node, instead of relying on only one transaction node for processing, or the transaction nodes communicate with each other to obtain the target transaction result, and the processing procedure is simple and the result is reliable.

In one embodiment, the transaction processing method may further include: the transaction server sends the target transaction result to the sorting server to cause the sorting server to sort the target transaction result in a preset order, and receive the data acquisition request of the current transaction node. And returning the target transaction result corresponding to the transaction request to the current transaction node according to the data acquisition request.

Specifically, each time the transaction server calculates the target transaction result, the transaction server sends the target transaction result to the sorting server for saving. After receiving the target transaction result, the sorting server sorts the target transaction results according to preset criteria, for example, it can be sorted and saved in chronological order. The sorting server receives a data acquisition request of the current transaction node, where the data acquisition request includes a starting position of the data and a length of the data, and then the sorting server acquires the corresponding data according to the data obtaining request, and returns the data to the transaction node. Storage is fine.

The transaction node, the transaction server and the sorting server are designed and implemented based on secure communication, including encryption of sensitive data before sending, signing of general messages and event messages, and checking and decrypting when receiving messages. To obtain the message, it is also possible to secure the transport layer based on the secure transport protocol. And the flotation server design and implementation support a large number of trading nodes, can communicate with a large number of trading nodes and data transmission, data is stored persistently, using kafka cluster to achieve.

In the above embodiment, the large load amount of mutual monitoring and data synchronization between the transaction nodes is avoided, the transaction availability is reduced and the system performance is greatly reduced, the transaction server controls the execution of the transaction, and the transaction is guaranteed based on the processing strategy. The consistency of the results; the trading node is mainly used to complete the execution of the transaction and store the consistent result of the transaction, the transaction node initializes the transaction-related data before executing the transaction; the sorting server sorts the consistency result after the transaction and Store and provide consistent result data for the transaction as required by the trading node.

It should be understood that although the various steps in the flowchart of FIG. 2 are sequentially displayed as indicated by the arrows, these steps are not necessarily performed in the order indicated by the arrows. Except as explicitly stated herein, the execution of these steps is not strictly limited, and the steps may be performed in other orders. Moreover, at least some of the steps in FIG. 2 may include a plurality of sub-steps or stages, which are not necessarily performed at the same time, but may be executed at different times, the execution of these sub-steps or stages The order is also not necessarily sequential, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of the other steps.

With continued reference to FIG. 3, FIG. 3 is a schematic diagram of a blockchain transaction processing apparatus in accordance with one or more embodiments, the apparatus comprising:

The transaction request communication module 100 is configured to receive a transaction request, acquire a current transaction node, and send the transaction request to the current transaction node, so that the current transaction node processes the transaction request.

The transaction parameter communication module 200 is configured to receive a parameter of the switched transaction node that is in the same cluster as the current transaction node when the current transaction node fails.

The replacement module 300 is configured to replace the parameter of the current transaction node with the parameter of the switched transaction node.

The processing module 400 is configured to receive a preliminary transaction processing result returned by the switched transaction node, and calculate a target transaction processing result according to the preliminary transaction processing result.

In one embodiment, the apparatus may further include a fault receiving module, configured to receive the transaction node fault information returned by the current transaction node when the transaction node in the cluster corresponding to the current transaction node fails.

a marking module, configured to mark the current trading node according to the information of the trading node failure; and if the current trading node is processing the transaction request, mark the preliminary transaction processing result corresponding to the current trading node as a transaction failure.

In one embodiment, the apparatus may further include a logout module, configured to determine, when receiving the information of the current transaction node logout, whether the current transaction node is processing the transaction request; if the current transaction node is processing the transaction request, The non-blocking mode continues to wait for the preliminary transaction processing result returned by the current trading node, and then deletes the parameters of the current trading node.

In one of the embodiments, the apparatus may further include a registration module for verifying the registration information upon receiving the registration information of the new transaction node; and adding the parameters of the new transaction node when the verification is passed.

In one embodiment, the processing module is further configured to determine whether the preliminary transaction processing result fed back by the current transaction node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value; and the number of preliminary transaction processing results indicating that the transaction is successful When the value is greater than or equal to the preset value, the target transaction result indicates that the transaction is successful; when the number of preliminary transaction processing results indicating that the transaction is successful is less than the preset value, the target transaction result indicates that the transaction has failed.

In one embodiment, the apparatus further includes a sorting module, configured to send the target transaction result to the sorting server, so that the sorting server sorts the target transaction result in a preset order, and receives the data acquisition request of the current transaction node. Thereafter, the target transaction result corresponding to the transaction request is returned to the current trading node according to the data acquisition request.

For specific definitions of the blockchain transaction processing device, reference may be made to the above description of the transaction processing method, and details are not described herein again. Each of the above blockchain transaction processing devices may be implemented in whole or in part by software, hardware, and combinations thereof. Each of the above modules may be embedded in or independent of the processor in the computer device, or may be stored in a memory in the computer device in a software form, so that the processor invokes the operations corresponding to the above modules.

In one embodiment, a computer device is provided, which may be a server or a terminal. When the computer device is a server, such as a transaction server, its internal structure diagram can be as shown in FIG. The computer device includes a processor, memory, and network interface coupled by a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-transitory computer readable instruction storage medium, an internal memory. The non-transitory computer readable instruction storage medium stores an operating system and computer readable instructions. The internal memory provides an environment for the operation of an operating system and computer readable instructions in a non-transitory computer readable instruction storage medium. The network interface of the computer device is used to communicate with an external terminal via a network connection. The computer readable instructions are executed by a processor to implement a transaction processing method.

It will be understood by those skilled in the art that the structure shown in FIG. 4 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation of the computer device to which the solution of the present application is applied. The specific computer device may It includes more or fewer components than those shown in the figures, or some components are combined, or have different component arrangements.

A computer device comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to perform the steps of: receiving a transaction request, And acquiring the current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving the switched transaction after the current transaction node fails, and the switched transaction is in the same cluster as the current transaction node. The parameter of the node; the parameter of the current transaction node is replaced with the parameter of the switched transaction node; the preliminary transaction processing result returned by the switched transaction node is received, and the target transaction processing result is calculated according to the preliminary transaction processing result.

In one of the embodiments, the processor may also implement the following steps when executing the computer readable instructions:

If the transaction node in the cluster corresponding to the current transaction node fails, the information transaction server that returns the transaction node failure to the transaction server receives the transaction node failure information returned by the current transaction node; the transaction server according to the transaction node failure information The current transaction node is marked; if the current transaction node is processing the transaction request, the transaction server marks the preliminary transaction processing result corresponding to the current transaction node as a transaction failure.

In one embodiment, the processor may further implement the following steps: when receiving the information of the current transaction node logout, determining whether the current transaction node is processing the transaction request; if the current transaction node is processing the transaction The request deletes the parameters of the current transaction node after waiting for the preliminary transaction processing result returned by the current transaction node through the asynchronous non-blocking mode.

In one embodiment, the processor may further implement the following steps when executing the computer readable instructions: verifying the registration information when the registration information of the new transaction node is received; adding a new transaction when the verification is passed The parameters of the node.

In one embodiment, the processor may further implement the following steps when determining that the current transaction processing feedback of the current transaction node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value; If the number of successful preliminary transaction processing results is greater than or equal to the preset value, the target transaction result indicates that the transaction is successful; when the number of preliminary transaction processing results indicating that the transaction is successful is less than the preset value, the target transaction result indicates that the transaction has failed.

In one embodiment, the processor may further implement the steps of: sending the target transaction result to the sorting server to cause the sorting server to sort the target transaction result in a preset order and receiving the current trading node when executing the computer readable instructions After the data acquisition request, the target transaction result corresponding to the transaction request is returned to the current transaction node according to the data acquisition request.

One or more non-volatile storage media storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of: receiving a transaction request, and obtaining The current trading node sends the transaction request to the current trading node to cause the current trading node to process the transaction request; and receives the parameter of the switched trading node that is switched in the same cluster as the current trading node when the current trading node fails. The parameter of the current transaction node is replaced with the parameter of the switched transaction node; the preliminary transaction processing result returned by the switched transaction node is received, and the target transaction processing result is calculated according to the preliminary transaction processing result.

In one embodiment, when the computer readable instructions are executed by the processor, the following steps may be further implemented: if the transaction nodes in the cluster corresponding to the current transaction node both fail, receiving the transaction node failure returned by the current transaction node Information; the current transaction node is marked according to the information of the transaction node failure; if the current transaction node is processing the transaction request, the preliminary transaction processing result corresponding to the current transaction node is marked as a transaction failure.

In one embodiment, when the computer readable instructions are executed by the processor, the following steps may be further implemented: if receiving the information of the current transaction node cancellation, determining whether the current transaction node is processing the transaction request; if the current transaction node is processing the transaction The request deletes the parameters of the current transaction node after waiting for the preliminary transaction processing result returned by the current transaction node through the asynchronous non-blocking mode.

In one embodiment, when the computer readable instructions are executed by the processor, the following steps may be further implemented: if the registration information of the new transaction node is received, the registration information is verified; when the verification is passed, a new one is added. The parameters of the trading node.

In one embodiment, the step of calculating the target transaction processing result according to the preliminary transaction processing result implemented by the processor when the computer readable instruction is executed by the processor may include: determining that the preliminary transaction processing result fed back by the current transaction node participating in the transaction indicates the transaction Whether the number of success is greater than or equal to the preset value; when the number of preliminary transaction processing results indicating that the transaction is successful is greater than or equal to the preset value, the target transaction result indicates that the transaction is successful; when the number of preliminary transaction processing results indicating that the transaction is successful is less than the preset When the value is, the target transaction result indicates that the transaction failed.

In one of the embodiments, the computer readable instructions when executed by the processor may further implement the steps of: transmitting the target transaction result to the sorting server to cause the sorting server to sort the target transaction results in a preset order, and receiving the current transaction After the data acquisition request of the node, the target transaction result corresponding to the transaction request is returned to the current transaction node according to the data acquisition request.

One of ordinary skill in the art can understand that all or part of the process of implementing the above embodiments can be completed by computer readable instructions, which can be stored in a non-volatile computer. The readable storage medium, which when executed, may include the flow of an embodiment of the methods as described above. Any reference to a memory, storage, database or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of formats, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronization chain. Synchlink DRAM (SLDRAM), Memory Bus (Rambus) Direct RAM (RDRAM), Direct Memory Bus Dynamic RAM (DRDRAM), and Memory Bus Dynamic RAM (RDRAM).

The technical features of the above-described embodiments may be arbitrarily combined. For the sake of brevity of description, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction between the combinations of these technical features, All should be considered as the scope of this manual.

The above-mentioned embodiments are merely illustrative of several embodiments of the present application, and the description thereof is more specific and detailed, but is not to be construed as limiting the scope of the invention. It should be noted that a number of variations and modifications may be made by those skilled in the art without departing from the spirit and scope of the present application. Therefore, the scope of the invention should be determined by the appended claims.

Claims

A transaction processing method, including:

Receiving a transaction request, and acquiring a current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving when the current transaction node fails Switching parameters of the switched transaction node in the same cluster as the current transaction node;

Replace the parameters of the current trading node with the parameters of the switched trading node; and

Receiving a preliminary transaction processing result returned by the switched transaction node, and calculating a target transaction processing result according to the preliminary transaction processing result.
The method of claim 1 further comprising:

Receiving transaction node failure information returned by the current transaction node if a transaction node in the cluster corresponding to the current transaction node fails;

Marking the current transaction node according to the information of the transaction node failure; and

If the current transaction node is processing a transaction request, the preliminary transaction processing result corresponding to the current transaction node is marked as a transaction failure.
The method of claim 1 further comprising:

If the information of the current transaction node cancellation is received, determining whether the current transaction node is processing a transaction request; and

If the current transaction node is processing the transaction request, the parameter of the current transaction node is deleted after continuing to wait for the preliminary transaction processing result returned by the current transaction node by the asynchronous non-blocking manner.
The method of claim 1 further comprising:

If the registration information of the new transaction node is received, the registration information is verified; and

When the verification is passed, the parameters of the new trading node are added.
The method according to claim 1, wherein the calculating the target transaction processing result according to the preliminary transaction processing result comprises:

Determining whether the preliminary transaction result fed back by the current trading node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value;

When the number of the preliminary transaction results indicating that the transaction is successful is greater than or equal to a preset value, the target transaction result indicates that the transaction is successful;

When the number of the preliminary transaction results indicating that the transaction is successful is less than a preset value, the target transaction result indicates that the transaction has failed.
The method of claim 1 further comprising:

Sending the target transaction result to the sorting server, so that the sorting server sorts the target transaction result in a preset order, and after receiving the data acquisition request of the current transaction node, according to the data acquisition request The current trading node returns a target transaction result corresponding to the transaction request.
A blockchain transaction processing device, comprising:

a transaction request communication module, configured to receive a transaction request, and acquire a current transaction node, and send the transaction request to the current transaction node, so that the current transaction node processes the transaction request;

a node parameter communication module, configured to receive, when the current transaction node fails, a parameter of the switched transaction node that is switched after the current transaction node is in the same cluster;

a replacement module, configured to replace parameters of the current transaction node with parameters of the switched transaction node;

And a processing module, configured to receive a preliminary transaction processing result returned by the switched transaction node, and calculate a target transaction processing result according to the preliminary transaction processing result.
The apparatus according to claim 7, wherein said apparatus further comprises a sorting module for transmitting said target transaction result to said sorting server, so that said sorting server compares said target transaction result in a predetermined order After sorting and receiving the data acquisition request of the current transaction node, returning a target transaction result corresponding to the transaction request to the current transaction node according to the data acquisition request.
The device according to claim 7, wherein the device further comprises:

a fault receiving module, configured to receive, when the transaction node in the cluster corresponding to the current transaction node fails, receive the transaction node fault information returned by the current transaction node; and

a marking module, configured to mark the current transaction node according to the information of the transaction node failure; if the current transaction node is processing a transaction request, mark a preliminary transaction processing result corresponding to the current transaction node as a transaction failure.
A computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executed by the one or more processors to cause the one or more The processors perform the following steps:

Receiving a transaction request, and acquiring a current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving when the current transaction node fails Switching parameters of the switched transaction node in the same cluster as the current transaction node;

Replace the parameters of the current trading node with the parameters of the switched trading node; and

Receiving a preliminary transaction processing result returned by the switched transaction node, and calculating a target transaction processing result according to the preliminary transaction processing result.
The computer apparatus according to claim 10, wherein said processor further performs the following steps when said computer readable instructions are executed:

Receiving, by the transaction node in the cluster corresponding to the current transaction node, a transaction node failure information returned by the current transaction node;

Marking the current transaction node according to the information of the transaction node failure; and

If the current transaction node is processing a transaction request, the preliminary transaction processing result corresponding to the current transaction node is marked as a transaction failure.
The computer apparatus according to claim 10, wherein said processor further performs the following steps when said computer readable instructions are executed:

If the information of the current transaction node cancellation is received, determining whether the current transaction node is processing a transaction request; and

If the current transaction node is processing the transaction request, the parameter of the current transaction node is deleted after continuing to wait for the preliminary transaction processing result returned by the current transaction node by the asynchronous non-blocking manner.
The computer apparatus according to claim 10, wherein said processor further performs the following steps when said computer readable instructions are executed:

If the registration information of the new transaction node is received, the registration information is verified; and

When the verification is passed, the parameters of the new trading node are added.
The computer device according to claim 10, wherein the calculation of the target transaction processing result according to the preliminary transaction processing result performed by the processor when the computer readable instructions are executed comprises:

Determining whether the preliminary transaction result fed back by the current trading node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value;

When the number of the preliminary transaction results indicating that the transaction is successful is greater than or equal to a preset value, the target transaction result indicates that the transaction is successful;

When the number of the preliminary transaction results indicating that the transaction is successful is less than a preset value, the target transaction result indicates that the transaction has failed.
The computer apparatus according to claim 10, wherein said processor further performs the following steps when said computer readable instructions are executed:

Sending the target transaction result to the sorting server, so that the sorting server sorts the target transaction result in a preset order, and after receiving the data acquisition request of the current transaction node, according to the data acquisition request The current trading node returns a target transaction result corresponding to the transaction request.
One or more non-transitory computer readable storage mediums storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the following steps:

Receiving a transaction request, and acquiring a current transaction node, sending the transaction request to the current transaction node, so that the current transaction node processes the transaction request; receiving when the current transaction node fails Switching parameters of the switched transaction node in the same cluster as the current transaction node;

Replace the parameters of the current trading node with the parameters of the switched trading node; and

Receiving a preliminary transaction processing result returned by the switched transaction node, and calculating a target transaction processing result according to the preliminary transaction processing result.
The storage medium of claim 16 wherein said computer readable instructions are further executed by said processor to perform the following steps:

Receiving transaction node failure information returned by the current transaction node if a transaction node in the cluster corresponding to the current transaction node fails;

Marking the current transaction node according to the information of the transaction node failure; and

If the current transaction node is processing a transaction request, the preliminary transaction processing result corresponding to the current transaction node is marked as a transaction failure.
The storage medium of claim 16 wherein said computer readable instructions are further executed by said processor to perform the following steps:

If the information of the current transaction node cancellation is received, determining whether the current transaction node is processing a transaction request; and

If the current transaction node is processing the transaction request, the parameter of the current transaction node is deleted after continuing to wait for the preliminary transaction processing result returned by the current transaction node by the asynchronous non-blocking manner.
The storage medium of claim 16 wherein said computer readable instructions are further executed by said processor to perform the following steps:

If the registration information of the new transaction node is received, the registration information is verified; and

When the verification is passed, the parameters of the new trading node are added.
The storage medium according to claim 16, wherein the calculation of the target transaction processing result according to the preliminary transaction processing result performed by the computer-readable instruction when executed by the processor comprises:

Determining whether the preliminary transaction result fed back by the current trading node participating in the transaction indicates whether the number of successful transactions is greater than or equal to a preset value;

When the number of the preliminary transaction results indicating that the transaction is successful is greater than or equal to a preset value, the target transaction result indicates that the transaction is successful;

When the number of the preliminary transaction results indicating that the transaction is successful is less than a preset value, the target transaction result indicates that the transaction has failed.