CN112749175B - Transaction processing method and device, electronic equipment and medium - Google Patents
Transaction processing method and device, electronic equipment and medium Download PDFInfo
- Publication number
- CN112749175B CN112749175B CN201911051855.6A CN201911051855A CN112749175B CN 112749175 B CN112749175 B CN 112749175B CN 201911051855 A CN201911051855 A CN 201911051855A CN 112749175 B CN112749175 B CN 112749175B
- Authority
- CN
- China
- Prior art keywords
- machine room
- database
- transaction
- mapping relation
- transaction information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2365—Ensuring data consistency and integrity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The present disclosure provides a transaction processing method, comprising: receiving a transaction request message, wherein the transaction request message carries transaction information; in response to the transaction request message, performing the following operations: a first machine room for processing the transaction is pre-determined according to a preset routing rule; writing a mapping relation between the transaction information and the first machine room into the first database and the second database, and returning a corresponding operation result; and determining a second machine room for processing the current transaction according to the operation result. The present disclosure also provides a transaction processing apparatus, an electronic device, and a computer-readable storage medium.
Description
Technical Field
The present disclosure relates to a transaction processing method, a transaction processing method apparatus, an electronic device, and a computer-readable storage medium.
Background
The network connection service belongs to a network payment service with higher fund risk, and one important function of the system design is transaction duplicate prevention. The payment mechanism should follow the transaction serial number rule and carry out export idempotent anti-duplication, so as to ensure the correctness and uniqueness of the transaction serial number sent to the internet connection platform. The internet connection platform performs entrance idempotent so as to prevent the transaction serial numbers conforming to the rules from being duplicated.
Disclosure of Invention
One aspect of the present disclosure provides a transaction processing method, including: receiving a transaction request message, wherein the transaction request message carries transaction information; in response to the transaction request message, performing the following operations: a first machine room for processing the transaction is pre-determined according to a preset routing rule; writing the mapping relation between the transaction information and the first machine room into a first database and a second database, and returning a corresponding operation result; and determining a second machine room for processing the current transaction according to the operation result.
Optionally, the determining, according to the operation result, a second machine room for processing the current transaction includes at least one of the following: if the operation result represents that the writing of the first database and the second database is successful, determining that the second machine room is the predetermined first machine room; and if the operation result represents that one of the first database and the second database is successfully written and the other is abnormally written, determining that the second machine room is also the predetermined first machine room.
Optionally, the transaction information includes a transaction serial number, the transaction serial number includes a machine room identification bit, and the machine room identification bit is written with a machine room identifier; the determining, according to the operation result, a second machine room for processing the current transaction includes: if the operation result represents that the writing of the first database and the second database is abnormal, determining whether the first machine room is the machine room represented by the machine room identifier; and if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the transaction.
Optionally, the method further comprises: and supplementing the mapping relation to the database which is written with the abnormality at present.
Optionally, the determining, according to the operation result, a second machine room for processing the current transaction includes: if the operation result represents that one of the first database and the second database fails to be written and the other one of the first database and the second database fails to be written or is written abnormally, inquiring the database which fails to be written currently and returning an inquiry result; and if the query result represents that the mapping relation between the transaction information and other machine rooms exists in the database with the current writing failure, taking the other machine rooms as the second machine room.
Optionally, the method further comprises: and writing the mapping relation between the transaction information and the other machine rooms into a database which is successfully written or abnormally written at present.
Optionally, the transaction information includes a transaction serial number, the transaction serial number includes a machine room identification bit, and the machine room identification bit is written with a machine room identifier; the method further comprises the steps of: if the query result represents that the mapping relation between the transaction information and the other machine rooms does not exist in the database of the current writing failure, determining whether the first machine room is the machine room represented by the machine room identifier; and if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the transaction.
Optionally, the determining, according to the operation result, a second machine room for processing the current transaction includes: if the operation result represents that the writing of the first database and the writing of the second database fail, inquiring the first database and the second database and returning corresponding inquiry results; and determining the second machine room according to the query result.
Optionally, the determining the second machine room according to the query result includes: if the query result represents that a first mapping relation between the transaction information and other machine rooms exists in the first database and a second mapping relation between the transaction information and other machine rooms exists in the second database, determining whether the first mapping relation is consistent with the second mapping relation; and if the first mapping relation is consistent with the second mapping relation, taking the other machine rooms as the second machine room.
Optionally, the method further comprises: and if the first mapping relation is inconsistent with the second mapping relation, rejecting the transaction.
Optionally, the transaction information includes a transaction serial number, the transaction serial number includes a machine room identification bit, and the machine room identification bit is written with a machine room identifier; the determining the second machine room according to the query result includes: if the query result represents that the mapping relation between the transaction information and other machine rooms does not exist in the first database and the second database, determining whether the first machine room is the machine room represented by the machine room identifier; and if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the transaction.
Optionally, the method further comprises: and supplementing the mapping relation between the transaction information and the first machine room to a database which is not written currently.
Optionally, the method further comprises: and if the first machine room is not the machine room characterized by the machine room identifier, rejecting the transaction.
Optionally, the determining the second machine room according to the query result includes: and if the query result represents that the mapping relation between the transaction information and other machine rooms exists in one of the first database and the second database and the mapping relation between the transaction information and other machine rooms does not exist in the other database, determining that the second machine room is a third machine room, wherein the third machine room is the machine room mapped with the transaction information in the existing mapping relation.
Optionally, the method further comprises: and supplementing a first mapping relation to a database without mapping relation between the transaction information and other machine rooms, wherein the first mapping relation is the mapping relation between the transaction information and the third machine room.
Optionally, before writing the mapping relationship between the transaction information and the first machine room to the first database and the second database and returning the corresponding operation result, the method further includes: determining whether the mapping relation needs to be written into the first database and the second database.
Optionally, the method further comprises: and controlling the expiration time of the mapping relation in the first database and the second database.
Optionally, the transaction information includes an identifier of a payment mechanism; and the method further comprises, during writing the mapping relationship to the first database and the second database: and performing compression control on the identifier of the payment mechanism.
Optionally, the transaction information includes a transaction serial number; and the method further comprises setting a state of the transaction serial number according to the operation result, wherein the state comprises one or more of the following states: a first processing state; a non-first processing state; and an uncertain state.
Another aspect of the present disclosure provides a transaction processing apparatus, comprising: the receiving module is used for receiving a transaction request message, wherein the transaction request message carries transaction information; the response module is used for responding to the transaction request message and executing the following operations: a first machine room for processing the transaction is pre-determined according to a preset routing rule; writing the mapping relation between the transaction information and the first machine room into a first database and a second database, and returning a corresponding operation result; and determining a second machine room for processing the current transaction according to the operation result.
Another aspect of the present disclosure provides an electronic device, comprising: one or more processors; and a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the methods of embodiments of the present disclosure.
Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions that, when executed, are configured to implement a method of an embodiment of the present disclosure.
Another aspect of the present disclosure provides a computer program comprising computer executable instructions which, when executed, are for implementing the method of the embodiments of the present disclosure.
Drawings
For a more complete understanding of the present disclosure and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
FIG. 1 schematically illustrates an application scenario of a transaction processing method and apparatus according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow chart of a transaction processing method according to an embodiment of the disclosure;
FIG. 3A schematically illustrates a schematic diagram of a dual redis write success in accordance with an embodiment of the present disclosure;
FIG. 3B schematically illustrates a schematic diagram of one redis write successful and another redis write exception according to another embodiment of the present disclosure;
FIG. 3C schematically illustrates a schematic diagram of a dual redis write exception according to another embodiment of the present disclosure;
FIG. 3D schematically illustrates a schematic diagram of one redis write failing and another redis write success according to another embodiment of the present disclosure;
FIG. 3E schematically illustrates a schematic diagram of one redis write failing and another redis write exception according to another embodiment of the present disclosure;
FIG. 3F schematically illustrates a schematic diagram of a dual redis write failure according to another embodiment of the present disclosure;
FIG. 4 schematically illustrates a block diagram of a transaction processing device according to an embodiment of the disclosure; and
fig. 5 schematically illustrates a block diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is only exemplary and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the present disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. In addition, in the following description, descriptions of well-known structures and techniques are omitted so as not to unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and/or the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It should be noted that the terms used herein should be construed to have meanings consistent with the context of the present specification and should not be construed in an idealized or overly formal manner.
Where expressions like at least one of "A, B and C, etc. are used, the expressions should generally be interpreted in accordance with the meaning as commonly understood by those skilled in the art (e.g.," a system having at least one of A, B and C "shall include, but not be limited to, a system having a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a formulation similar to at least one of "A, B or C, etc." is used, in general such a formulation should be interpreted in accordance with the ordinary understanding of one skilled in the art (e.g. "a system with at least one of A, B or C" would include but not be limited to systems with a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Some of the block diagrams and/or flowchart illustrations are shown in the figures. It will be understood that some blocks of the block diagrams and/or flowchart illustrations, or combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the instructions, when executed by the processor, create means for implementing the functions/acts specified in the block diagrams and/or flowchart. The techniques of this disclosure may be implemented in hardware and/or software (including firmware, microcode, etc.). Additionally, the techniques of this disclosure may take the form of a computer program product on a computer-readable storage medium having instructions stored thereon, the computer program product being for use by or in connection with an instruction execution system.
Embodiments of the present disclosure provide a transaction processing method and a transaction processing apparatus capable of applying the same. The method may include, for example, receiving a transaction request message carrying transaction information, and then, in response to the transaction request message, performing the following operations: the method comprises the steps of pre-determining a first machine room for processing the current transaction according to a preset routing rule, writing the mapping relation between transaction information and the first machine room into a first database and a second database, returning a corresponding operation result, and further determining a second machine room for processing the current transaction according to the returned operation result, wherein the second machine room can be the first machine room or other machine rooms different from the first machine room according to the returned operation result.
Fig. 1 schematically illustrates an application scenario of a transaction processing method and apparatus according to an embodiment of the present disclosure. It should be noted that fig. 1 is merely an example of a scenario in which embodiments of the present disclosure may be applied to assist those skilled in the art in understanding the technical content of the present disclosure, but does not mean that embodiments of the present disclosure may not be used in other devices, systems, environments, or scenarios.
As shown in fig. 1, it is assumed that corresponding machine rooms are provided for the internet connection platform in beijing, shanghai, and Shenzhen three places, respectively. For example, in Beijing, the machine room 10 and the machine room 11 are provided, in the sea, the machine room 20 and the machine room 21 are provided, and in Shenzhen, the machine room 30 and the machine room 31 are provided. In this application scenario, the internet-connected platform can support cross-machine-room routing, but needs to ensure that local same cities (such as machine room 10 and machine room 11) have consistent data, and can realize idempotent anti-duplication for each transaction, namely, each transaction serial number.
The technical scheme provided by the embodiment of the disclosure can achieve the purpose. In addition, in order to realize transaction duplicate prevention, the embodiment of the disclosure adopts a strategy of introducing local co-city double-write rediss on the routing service in front of the channel to realize idempotent control, and can realize duplicate prevention control efficiently and stably only if the data of the local co-city double-write maintains consistency.
The present disclosure will be described in detail below in conjunction with specific embodiments and with reference to the accompanying drawings.
Fig. 2 schematically illustrates a flow chart of a transaction processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S210 to S240, wherein:
in operation S210, a transaction request message is received, where the transaction request message carries transaction information, and in response to the transaction request message, the following operations S220 to S240 are performed.
It should be noted that, in the embodiment of the present disclosure, the transaction information may include, for example, but not limited to, a transaction serial number of the present transaction and an identifier of a transaction payment mechanism.
Further, in the embodiment of the present disclosure, a transaction serial number may include 32 bits, where the first 8 bits are the year, month and day bits, for example 20190827, the first 2 bits of the last 6 bits are machine room identification bits, for example 10 is the machine room 10, the last 4 bits of the last 6 bits are library table control bits, and the middle 18 bits are random bits, to ensure that the transaction serial number is unique on the same day.
Referring back to fig. 1, in the embodiment of the present disclosure, specifically, one channel front may be provided for each machine room for performing operations S210 to S240.
In operation S220, a first machine room for processing the present transaction is predetermined according to a preset routing rule.
It should be noted that, in the embodiment of the present disclosure, the routing rule may be specifically set according to actual needs. For example, the machine room may be routed according to a category of the transaction payment mechanism (e.g., all transactions of the payment device may be handled using the same machine room), or the machine room may be routed according to a transaction category (e.g., all transactions of the quick payment device may be handled using the same machine room), or the machine room may be routed in combination with a category of the transaction payment mechanism and a status of the machine room (e.g., whether the machine room is faulty or overloaded, etc.), or the machine room may be routed in combination with a category of the transaction and a status of the machine room, etc., without limitation herein.
For operation S220, for example, if a transaction request message from a payment device is received, the machine room for processing the transaction may be predetermined as a specific machine room, such as the machine room 10 in beijing, according to the routing rule.
In operation S230, the mapping relationship between the transaction information and the first machine room is written into the first database and the second database, and the corresponding operation result is returned.
It should be noted that in the embodiment of the present disclosure, the first database and the second database may be two different redis databases.
For operation S230, the mapping relationship may be written to the two databases specifically once every time a transaction request message is received.
It should be noted that, in the embodiment of the present disclosure, for any database described above, if one mapping relation is written successfully, it is characterized that there is no mapping relation related to the transaction information in the mapping relation before in the database. Conversely, if one mapping fails to be written, it is characterized that there may already be some mapping in the database related to the transaction information in that mapping. And if one mapping relation causes abnormal writing due to network jitter and the like, the characterization does not determine whether a certain mapping relation related to transaction information in the mapping relation exists in the database before.
Based on this, for the above-described write operation, the returned operation result may include: double databases are successfully written, double databases are failed to be written, double databases are abnormal to be written, one database is failed to be written and the other database is successful to be written, one database is failed to be written and the other database is abnormal to be written, and one database is successful to be written and the other database is abnormal to be written.
In operation S240, a second machine room for processing the present transaction is determined according to the operation result.
It should be noted that, in the embodiment of the present disclosure, the first machine room is a machine room for processing the present transaction, which is predetermined according to the routing rule, and the second machine room is a machine room for processing the present transaction, which is finally determined according to the operation result. The second machine room may be the first machine room, that is, the predetermined machine room is the machine room that finally processes the transaction. The second machine room may also be other than the first machine room, i.e. the predetermined machine room is not the machine room that ultimately handles the transaction. This may for example determine if the machine room (i.e. the machine room indicated by the sign of the transaction flow number) and the first machine room predetermined by the routing rules are the same machine room, wherein if so, the machine room is taken as the second machine room, otherwise the second machine room is empty, the transaction is rejected, etc.
It should be noted that, the detailed steps of determining the second machine room for different operation results will be described in the following embodiments, which are not described herein.
According to the embodiment of the disclosure, for the transaction requested by the cross-machine room, the transaction aiming at the same transaction serial number can be ensured to be processed in the same machine room, so that the consistency of transaction data is ensured, and idempotent duplicate prevention can be realized for each transaction serial number. Namely, the embodiment of the disclosure improves the usability of storage and the idempotency of service through a double-writing mechanism.
The method illustrated in fig. 2 is further described below with reference to fig. 3A-3F in conjunction with the exemplary embodiment.
As an alternative embodiment, the determining of the second machine room for processing the present transaction according to the operation result in operation S240 may include at least one of the following, for example.
(1) And if the operation result indicates that the writing of the first database and the second database is successful, determining the second machine room as the predetermined first machine room.
FIG. 3A schematically illustrates a schematic diagram of double redis write success according to an embodiment of the present disclosure.
As shown in fig. 3A, both redis databases were successfully written for the same mapping. In this case, the present transaction is processed based on the routing result.
Through the embodiment of the disclosure, the same machine room and cross-machine room routing can be supported for the case that the double redis writing is successful.
Furthermore, as previously described, if a mapping is written successfully in a database, it is characterized that there was not previously any mapping in the database that is related to transaction information in the mapping. Further, if one mapping relation is successfully written in both databases, it is characterized that any mapping relation related to transaction information in the mapping relation does not exist before in both databases, and it is further characterized that the transaction serial number used in the transaction is the serial number appearing for the first time, in this case, the transaction serial number can be set to be in the state of appearing for the first time, so that the transaction can be processed later, and the transaction processing performance is improved.
(2) If the operation result indicates that one of the first database and the second database is successfully written and the other is abnormally written, the second machine room is determined to be the predetermined first machine room.
FIG. 3B schematically illustrates a schematic diagram of one redis write successful and another redis write exception according to another embodiment of the present disclosure.
As shown in FIG. 3B, for the same mapping, one of the two redis databases is successfully written and the other redis database is abnormally written. In this case, the present transaction is also processed based on the routing result.
It should be understood that, in the embodiment of the present disclosure, the routing result is the first machine room predetermined according to the routing rule.
By the embodiment of the disclosure, if any redis access is abnormal during double redis writing, only the same machine room routing is supported, and the cross-machine room routing is not supported.
In addition, as described above, if a mapping relation causes writing abnormality in a database due to network jitter or the like, it is not determined whether or not a certain mapping relation related to transaction information in the mapping relation exists before in the database. In addition, in the embodiment of the present disclosure, since the mapping relationship is written successfully in another database, that is, although redis access abnormality occurs, there is no idempotent, so it cannot be determined whether the transaction serial number used in the transaction is the serial number that occurs for the first time, in this case, the transaction serial number may be set to an uncertain state, so that the transaction is processed later, and the performance of transaction processing is improved.
In addition, in the embodiment of the present disclosure, although an access exception occurs in a redis database, since the present transaction is processed according to the routing result, that is, the present transaction is processed normally. In this case, in order to prevent a similar situation from occurring when a subsequent transaction request is processed, a complementary data operation may be performed on the redis database having an access abnormality, thereby supplementing the corresponding mapping relationship into the redis database.
Further, in the embodiments of the present disclosure, the complement data operation is an overlay insertion operation. In the embodiment of the present disclosure, whether to perform the overlay insertion operation may be determined according to a condition. Specifically, if a redis database accesses an exception when writing a mapping relationship, but the transaction is normally processed, an overlay insertion operation is performed.
As an alternative embodiment, the transaction information may comprise, for example, a transaction serial number, which may comprise, for example, a machine room identification bit having a machine room identifier written thereon. Wherein, the determining, in operation S240, the second machine room for processing the present transaction according to the operation result may include, for example: if the operation result represents that the first database and the second database are written abnormally, further determining whether the first machine room is the machine room represented by the machine room identifier, and if the first machine room is the machine room represented by the machine room identifier, taking the machine room represented by the machine room identifier as the machine room for processing the transaction.
FIG. 3C schematically illustrates a schematic diagram of a dual redis write exception according to another embodiment of the present disclosure.
As shown in fig. 3C, in the embodiment of the present disclosure, for the case that the two redis databases are both written with exceptions, whether the transaction is normally processed is mainly determined by whether the routing result is consistent with the machine room. If the two are consistent, the first machine room processes the transaction (namely normally processes the transaction) by using the routing result, otherwise, the transaction is refused.
Further, as an alternative embodiment, the method may further comprise, for example, writing the mapping relationship to a database in which the anomaly is currently written.
Specifically, it may be determined whether the present transaction is normally processed when the data is rewritten, wherein if the determination result indicates that the present transaction is normally processed, an overlay insertion operation is performed to rewrite the corresponding data.
In addition, in the disclosed embodiments, compensation criteria may also be set to alert all rejected transactions.
As an alternative embodiment, the determining, in operation S240, the second machine room for processing the present transaction according to the operation result may include, for example: if the operation result represents that one of the first database and the second database fails to write and the other one of the first database and the second database fails to write or is abnormal in writing, inquiring the database which fails to write currently and returning an inquiry result, and if the inquiry result represents that the mapping relation between the transaction information and other machine rooms exists in the database which fails to write currently, taking the other machine rooms as the second machine room.
FIG. 3D schematically illustrates a schematic diagram of one redis write failing and another redis write success according to another embodiment of the present disclosure.
FIG. 3E schematically illustrates a schematic diagram of one redis write failing and another redis write exception according to another embodiment of the present disclosure.
As shown in fig. 3D and fig. 3E, if one writing fails and the other writing is successful or the writing is abnormal in the dual dis database, whether the transaction is processed normally mainly depends on the query result of the dis database with respect to the writing failure. And if the mapping relation between the current transaction information and other machine rooms exists in the database through inquiry, the inquiry result, namely the other machine rooms, is used for processing the transaction (namely the transaction is processed normally). For example, for the current transaction request, after mapping the transaction information of the current transaction with the machine room 10 through a routing rule, writing the mapped transaction information into a dual redis database, if one of the two is failed to write, the other is successful, and the query finds that a mapping relationship between the transaction information of the current transaction and the machine room 20 already exists in the redis database, and at this time, the machine room 20 is used as the machine room for finally processing the current transaction.
Furthermore, as previously described, if a mapping fails to be written in a database, it is characterized that there may already be some mapping in the database that is related to transaction information in the mapping. In addition, in the embodiment of the disclosure, since the writing of the mapping relationship in another database fails, that is, idempotent occurs when one database executes writing operation, it is determined that the transaction serial number used in the transaction is not the serial number appearing first, and in this case, the transaction serial number can be set to a state of not appearing first, so that the transaction can be processed later, and the performance of transaction processing is improved.
As an alternative embodiment, the method may further comprise, for example, writing the mapping relationship between the transaction information and the other machine room to a database of current successful writing or abnormal writing.
For example, if there is already a mapping relationship between the transaction information about the present transaction and the machine room 20 in the redis database with the writing failure, the mapping relationship between the transaction information and the machine room 20 may be rewritten in the redis database with the writing success or the writing abnormality.
Specifically, it may be determined whether the present transaction is normally processed when the data is rewritten, wherein if the determination result indicates that the present transaction is normally processed, an overlay insertion operation is performed to rewrite the corresponding data.
As an alternative embodiment, the transaction information may comprise, for example, a transaction serial number, which may comprise, for example, a machine room identification bit having a machine room identifier written thereon. The method may further comprise, for example: if the query result represents that the mapping relation between the transaction information and other machine rooms does not exist in the database of the current writing failure, determining whether the first machine room is the machine room represented by the machine room identifier, and if the first machine room is the machine room represented by the machine room identifier, taking the machine room represented by the machine room identifier as the machine room for processing the transaction.
Specifically, in the embodiment of the present disclosure, for a redis database that fails to write and does not have other mapping relationships related to the transaction information of the present transaction, whether the present transaction is normally processed mainly depends on whether the routing result is consistent with the present machine room. If the two are consistent, the first machine room processes the transaction (namely normally processes the transaction) by using the routing result, otherwise, the transaction is refused.
Furthermore, in the embodiments of the present disclosure, a case of rejecting a query may also occur for a redis database that fails to be written. For the scene of refusing to inquire, an alarm mechanism can be set for alarming.
As an alternative embodiment, the determining, in operation S240, the second machine room for processing the present transaction according to the operation result may include, for example: and if the operation result represents that the writing of the first database and the second database fails, inquiring the first database and the second database, returning corresponding inquiry results, and determining the second machine room according to the inquiry results.
FIG. 3F schematically illustrates a schematic diagram of a dual redis write failure according to another embodiment of the present disclosure.
As shown in fig. 3F, in the case of writing failure in the dual redis database, whether the transaction is processed normally depends mainly on the query result for the dual redis database. It should be noted that, in the embodiment of the present disclosure, the query result includes, but is not limited to, that the corresponding and consistent mapping relationship can be found in the dual dis databases, that the corresponding and inconsistent mapping relationship can be found in the dual dis databases, that the corresponding mapping relationship can be found in one of the dis databases and the corresponding mapping relationship cannot be found in the other dis database, that one or both of the dis databases reject the query request, and so on.
It should be noted that, the detailed steps of determining the machine room finally used for processing the present transaction for the specific query result will be described in the following embodiments, which are not repeated herein.
As an alternative embodiment, determining the second machine room according to the query result may for example include: if the query result characterizes that a first mapping relation between the transaction information and other machine rooms exists in the first database, and a second mapping relation between the transaction information and other machine rooms exists in the second database, determining whether the first mapping relation is consistent with the second mapping relation, and if the first mapping relation is consistent with the second mapping relation, taking the other machine rooms as the second machine rooms.
For example, if both the two redis databases fail to write for the current transaction request, and it is found by the query that there is a mapping relationship between the transaction information about the current transaction and the machine room 20 in both redis databases that fail to write, the machine room 20 is used as the machine room for processing the current transaction finally.
Further, as an alternative embodiment, the method may further comprise, for example, writing the mapping relationship between the transaction information and the first machine room to a database that fails to be written currently.
For example, for the above example, the mapping relationship between the transaction information of the present transaction and the machine room 20 may be rewritten into the redis databases of the two writing failures. Specifically, the overwrite insert operation may be employed for data overwrite.
As an alternative embodiment, the method may further comprise rejecting the transaction if it is determined that the first mapping is inconsistent with the second mapping.
For example, if both redis databases fail to write for the current transaction request, and it is found through the query that one redis database already has a mapping relationship between the transaction information about the current transaction and the machine room 20, and the other redis database already has a mapping relationship between the transaction information about the current transaction and the machine room 30, it is obvious that the two mapping relationships are inconsistent, and in this case, the current transaction is rejected.
As an alternative embodiment, the transaction information may comprise, for example, a transaction serial number, which may comprise, for example, a machine room identification bit having a machine room identifier written thereon. Determining the second machine room according to the query result may include, for example: if the query result represents that the mapping relation between the transaction information and other machine rooms does not exist in the first database and the second database, determining whether the first machine room is the machine room represented by the machine room identifier, and if the first machine room is the machine room represented by the machine room identifier, taking the machine room represented by the machine room identifier as the machine room for processing the transaction.
For example, if both the double redis databases fail to write for the current transaction request, and the two redis databases fail to write are found to have no mapping relation between the transaction information about the current transaction and any machine room through query, at this time, for example, whether the routing result is consistent with the current machine room can be further determined. If the transaction is consistent, the machine room is used for processing the transaction.
Further, as an optional embodiment, the method may further include, for example, writing the mapping relationship between the transaction information of the present transaction and the present machine room to the database that is currently written to fail.
As an alternative embodiment, the method may for example further comprise rejecting the transaction if it is determined that the first machine room is not the machine room characterized by the machine room identifier.
That is, in the embodiment of the present disclosure, if the routing result is inconsistent with the machine room, the present transaction is rejected. For example, if the routing result is room 10 and the present room is room 20, the transaction is rejected.
As an alternative embodiment, determining the second machine room according to the query result may for example include: and if the query result represents that the mapping relation between the transaction information and other machine rooms exists in one of the first database and the second database and the mapping relation between the transaction information and other machine rooms does not exist in the other database, determining that the second machine room is a third machine room, wherein the third machine room is the machine room mapped with the transaction information in the existing mapping relation.
For example, if both redis databases fail to write for the current transaction request, and it is found by polling that one redis database already has a mapping relationship between the transaction information about the current transaction and the machine room 20, and the other redis database does not have a mapping relationship between the transaction information about the current transaction and any machine room, the machine room 20 is used to process the current transaction in this case.
Further, as an alternative embodiment, the method may further comprise, for example: and supplementing a first mapping relation to a database without the mapping relation between the transaction information and other machine rooms, wherein the first mapping relation is the mapping relation between the transaction information and the third machine room.
For example, if both redis databases fail to write for the current transaction request, and it is found through the query that a mapping relationship between the transaction information about the current transaction and the machine room 20 already exists in one redis database, and a mapping relationship between the transaction information about the current transaction and any machine room does not exist in the other redis database, in this case, the mapping relationship between the transaction information about the current transaction and the machine room 20 may be rewritten into the other redis database. Specifically, the data writing can be performed by the overlay insertion operation.
As an alternative embodiment, the method may for example further comprise: before writing the mapping relation between the transaction information and the first machine room into the first database and the second database and returning the corresponding operation result, determining whether the mapping relation needs to be written into the first database and the second database.
In the embodiments of the present disclosure, since query-type transaction requests generally do not carry a risk of funds, there is a relatively high likelihood that non-query-type transaction requests carry a risk of funds. Therefore, when a message of a query transaction request is received, the query operation can be directly performed in response to the request message without performing related operations of the same-city double-writing mechanism. And when receiving the message of the non-query transaction request, executing the related operation of the same-city double-writing mechanism, determining whether to process the transaction according to the operation result, and determining a machine room for processing the transaction under the condition of determining to process the transaction.
As an alternative embodiment, the method may further comprise expiration time control of the mapping in the first database and the second database, for example.
For example, for transactions of the subscription class and the quick payment class, the expiration time of the relevant mapping relationship may be set to 25 hours; for refund-type transactions, the expiration time of the associated mapping relationship may be set to 3 days; for transactions of the payment class, the expiration time of the relevant mapping relationship may be set to 4 days, and so on.
In the embodiment of the disclosure, the storage capacity of the redis database can be improved by performing expiration time control on the related mapping relation written in the redis database.
As an alternative embodiment, the transaction information may include, for example, an identifier of the payment mechanism. The method may further comprise, for example, in writing the mapping to the first database and the second database: the identifier of the payment mechanism is compression controlled.
Specifically, compression control may be performed on identifiers of payment institutions whose markets are relatively large. For example, the payment treasures and the WeChat payment account for a relatively large amount, the identifier of the payment treasures may be set to 0 and the identifier of the WeChat may be set to 1 for compression purposes.
In the embodiment of the disclosure, the storage capacity of the redis database can be improved by performing compression control on the identifier of the payment mechanism when the related mapping relation is written in the redis database.
Fig. 4 schematically illustrates a block diagram of a transaction processing device according to an embodiment of the disclosure.
As shown in fig. 4, the transaction processing apparatus 400 includes a receiving module 401 and a responding module 402. The transaction processing device 400 may perform the methods described above with reference to the method embodiment portions of fig. 2, 3A-3F to effect transaction processing.
Specifically, the receiving module 401 is configured to receive a transaction request packet, where the transaction request packet carries transaction information.
The response module 402 is configured to respond to the transaction request message by performing the following operations: the method comprises the steps of presetting a first machine room for processing the current transaction according to preset routing rules, writing mapping relations between transaction information and the first machine room into a first database and a second database, returning corresponding operation results, and determining a second machine room for processing the current transaction according to the operation results.
It should be noted that, the device part embodiments and the method part embodiments are the same or similar in terms of the solved technical problems, the used technical means, the achieved technical effects, and the like, and are not described herein again.
Any number of the modules, or at least some of the functionality of any number, according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules according to embodiments of the present disclosure may be implemented as split into multiple modules. Any one or more of the modules according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system-on-chip, a system-on-a-substrate, a system-on-a-package, an Application Specific Integrated Circuit (ASIC), or in hardware or firmware in any other reasonable manner of integrating or packaging the circuits, or in any one of or in any suitable combination of three of software, hardware, and firmware. Alternatively, one or more of the modules according to embodiments of the present disclosure may be at least partially implemented as computer program modules, which when executed, may perform the corresponding functions.
For example, any of the receiving module 401 and the responding module 402 may be combined in one module to be implemented, or any of the modules may be split into a plurality of modules. Alternatively, at least some of the functionality of one or more of the modules may be combined with at least some of the functionality of other modules and implemented in one module. According to embodiments of the present disclosure, at least one of the receiving module 401 and the responding module 402 may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware, such as any other reasonable way of integrating or packaging the circuit, or in any one of or a suitable combination of three of software, hardware, and firmware. Alternatively, at least one of the receiving module 401 and the responding module 402 may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
Fig. 5 schematically illustrates a block diagram of an electronic device according to an embodiment of the disclosure. The electronic device shown in fig. 5 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
As shown in fig. 5, the electronic device 500 includes a processor 510, a computer-readable storage medium 520. The electronic device 500 may perform methods according to embodiments of the present disclosure.
In particular, processor 510 may include, for example, a general purpose microprocessor, an instruction set processor and/or an associated chipset and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), or the like. Processor 510 may also include on-board memory for caching purposes. Processor 510 may be a single processing unit or multiple processing units for performing the different actions of the method flows according to embodiments of the disclosure.
Computer-readable storage medium 520, which may be, for example, a non-volatile computer-readable storage medium, specific examples include, but are not limited to: magnetic storage devices such as magnetic tape or hard disk (HDD); optical storage devices such as compact discs (CD-ROMs); a memory, such as a Random Access Memory (RAM) or a flash memory; etc.
The computer-readable storage medium 520 may include a computer program 521, which computer program 521 may include code/computer-executable instructions that, when executed by the processor 510, cause the processor 510 to perform a method according to an embodiment of the present disclosure or any variation thereof.
The computer program 521 may be configured with computer program code comprising, for example, computer program modules. For example, in an example embodiment, code in computer program 521 may include one or more program modules, including, for example, 521A, 521B, … …. It should be noted that the division and number of modules is not fixed, and that a person skilled in the art may use suitable program modules or combinations of program modules according to the actual situation, which when executed by the processor 510, enable the processor 510 to perform the method according to embodiments of the present disclosure or any variations thereof.
At least one of the receiving module 401 and the responding module 402 may be implemented as computer program modules described with reference to fig. 5, which when executed by the processor 510, may implement the respective operations described above, according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium that may be embodied in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the apparatus/device/system. The computer-readable storage medium carries one or more programs which, when executed, implement methods in accordance with embodiments of the present disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example, but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that the features recited in the various embodiments of the disclosure and/or in the claims may be combined in various combinations and/or combinations, even if such combinations or combinations are not explicitly recited in the disclosure. In particular, the features recited in the various embodiments of the present disclosure and/or the claims may be variously combined and/or combined without departing from the spirit and teachings of the present disclosure. All such combinations and/or combinations fall within the scope of the present disclosure.
While the present disclosure has been shown and described with reference to certain exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present disclosure as defined by the appended claims and their equivalents. The scope of the disclosure should, therefore, not be limited to the above-described embodiments, but should be determined not only by the following claims, but also by the equivalents of the following claims.
Claims (21)
1. A transaction processing method, comprising:
receiving a transaction request message, wherein the transaction request message carries transaction information;
in response to the transaction request message, performing the following operations:
A first machine room for processing the transaction is pre-determined according to a preset routing rule;
writing the mapping relation between the transaction information and the first machine room into a first database and a second database, and returning a corresponding operation result; and
determining a second machine room for processing the current transaction according to the operation result, wherein,
and determining a second machine room for processing the current transaction according to the operation result, wherein the second machine room comprises at least one of the following components:
if the operation result represents that the writing of the first database and the second database is successful, determining that the second machine room is the predetermined first machine room;
and if the operation result represents that one of the first database and the second database is successfully written and the other is abnormally written, determining that the second machine room is also the predetermined first machine room.
2. The method of claim 1, wherein,
the transaction information comprises a transaction serial number, wherein the transaction serial number comprises a machine room identification position, and a machine room identifier is written on the machine room identification position;
the determining, according to the operation result, a second machine room for processing the current transaction includes:
If the operation result represents that the writing of the first database and the second database is abnormal, determining whether the first machine room is the machine room represented by the machine room identifier; and
and if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the current transaction.
3. The method according to claim 1 or 2, further comprising:
and supplementing the mapping relation to the database which is written with the abnormality at present.
4. The method according to claim 1, wherein the determining, according to the operation result, a second machine room for processing the present transaction includes:
if the operation result represents that one of the first database and the second database fails to be written and the other one of the first database and the second database fails to be written or is written abnormally, inquiring the database which fails to be written currently and returning an inquiry result; and
and if the query result represents that the mapping relation between the transaction information and other machine rooms exists in the database with the current writing failure, taking the other machine rooms as the second machine room.
5. The method of claim 4, further comprising:
And writing the mapping relation between the transaction information and the other machine rooms into a database which is successfully written or abnormally written at present.
6. The method of claim 4, wherein,
the transaction information comprises a transaction serial number, wherein the transaction serial number comprises a machine room identification position, and a machine room identifier is written on the machine room identification position;
the method further comprises the steps of: if the query result represents that the mapping relation between the transaction information and the other machine rooms does not exist in the database of the current writing failure, determining whether the first machine room is the machine room represented by the machine room identifier; and
and if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the current transaction.
7. The method according to claim 1, wherein the determining, according to the operation result, a second machine room for processing the present transaction includes:
if the operation result represents that the writing of the first database and the writing of the second database fail, inquiring the first database and the second database and returning corresponding inquiry results; and
And determining the second machine room according to the query result.
8. The method of claim 7, wherein the determining the second machine room according to the query result comprises:
if the query result represents that a first mapping relation between the transaction information and other machine rooms exists in the first database and a second mapping relation between the transaction information and other machine rooms exists in the second database, determining whether the first mapping relation is consistent with the second mapping relation; and
and if the first mapping relation is consistent with the second mapping relation, taking the other machine rooms as the second machine room.
9. The method of claim 8, further comprising:
and if the first mapping relation is inconsistent with the second mapping relation, rejecting the transaction.
10. The method of claim 7, wherein,
the transaction information comprises a transaction serial number, wherein the transaction serial number comprises a machine room identification position, and a machine room identifier is written on the machine room identification position;
the determining the second machine room according to the query result includes:
if the query result represents that the mapping relation between the transaction information and other machine rooms does not exist in the first database and the second database, determining whether the first machine room is the machine room represented by the machine room identifier; and
And if the first machine room is determined to be the machine room characterized by the machine room identifier, taking the machine room characterized by the machine room identifier as the machine room for processing the current transaction.
11. The method of claim 10, further comprising:
and supplementing the mapping relation between the transaction information and the first machine room to a database which is not written currently.
12. The method of any of claims 2, 6 or 10, further comprising:
and if the first machine room is not the machine room characterized by the machine room identifier, rejecting the transaction.
13. The method of claim 7, wherein the determining the second machine room according to the query result comprises:
if the query result characterizes that a mapping relationship between the transaction information and other machine rooms exists in one of the first database and the second database and a mapping relationship between the transaction information and other machine rooms does not exist in the other database, determining that the second machine room is a third machine room,
the third machine room is a machine room mapped with the transaction information in the existing mapping relation.
14. The method of claim 13, further comprising:
And supplementing a first mapping relation to a database which does not have the mapping relation between the transaction information and other machine rooms, wherein,
the first mapping relation is a mapping relation between the transaction information and the third machine room.
15. The method of claim 1, wherein prior to writing the mapping between the transaction information and the first machine room to the first database and the second database and returning the corresponding operation results, the method further comprises:
determining whether the mapping relation needs to be written into the first database and the second database.
16. The method of claim 1, further comprising:
and controlling the expiration time of the mapping relation in the first database and the second database.
17. The method of claim 1, wherein,
the transaction information includes an identifier of a payment mechanism; and
the method further includes, during writing the mapping relationship to the first database and the second database:
and performing compression control on the identifier of the payment mechanism.
18. The method of claim 1, wherein,
the transaction information comprises a transaction serial number; and
The method further comprises setting a state of the transaction serial number according to the operation result, wherein the state comprises one or more of the following states:
a first processing state;
a non-first processing state; and
the state is not determined.
19. A transaction processing device, comprising:
the receiving module is used for receiving a transaction request message, wherein the transaction request message carries transaction information;
the response module is used for responding to the transaction request message and executing the following operations:
a first machine room for processing the transaction is pre-determined according to a preset routing rule;
writing the mapping relation between the transaction information and the first machine room into a first database and a second database, and returning a corresponding operation result; and
determining a second machine room for processing the current transaction according to the operation result, wherein,
and determining a second machine room for processing the current transaction according to the operation result, wherein the second machine room comprises at least one of the following components:
if the operation result represents that the writing of the first database and the second database is successful, determining that the second machine room is the predetermined first machine room;
And if the operation result represents that one of the first database and the second database is successfully written and the other is abnormally written, determining that the second machine room is also the predetermined first machine room.
20. An electronic device, comprising:
one or more processors; and
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1 to 18.
21. A computer readable storage medium storing computer executable instructions which, when executed, are adapted to carry out the method of any one of claims 1 to 18.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911051855.6A CN112749175B (en) | 2019-10-30 | 2019-10-30 | Transaction processing method and device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911051855.6A CN112749175B (en) | 2019-10-30 | 2019-10-30 | Transaction processing method and device, electronic equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112749175A CN112749175A (en) | 2021-05-04 |
| CN112749175B true CN112749175B (en) | 2023-10-03 |
Family
ID=75641353
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911051855.6A Active CN112749175B (en) | 2019-10-30 | 2019-10-30 | Transaction processing method and device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112749175B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017084442A1 (en) * | 2015-11-20 | 2017-05-26 | 华为技术有限公司 | Mobile payment method and apparatus |
| CN109063027A (en) * | 2018-07-16 | 2018-12-21 | 阿里巴巴集团控股有限公司 | A kind of method and device for business processing |
| CN109493217A (en) * | 2018-10-16 | 2019-03-19 | 翟红鹰 | Prevent method, system, equipment and the computer readable storage medium for repeating to pay |
| CN110060161A (en) * | 2019-03-28 | 2019-07-26 | 众安信息技术服务有限公司 | It trades anti-heavy client service implementation method and serviced component for block chain |
| CN110264648A (en) * | 2019-05-10 | 2019-09-20 | 杭州米雅信息科技有限公司 | Data processing method and device, automatic teller machine and data processing system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7177866B2 (en) * | 2001-03-16 | 2007-02-13 | Gravic, Inc. | Asynchronous coordinated commit replication and dual write with replication transmission and locking of target database on updates only |
| US8984170B2 (en) * | 2011-09-09 | 2015-03-17 | Oracle International Corporation | Idempotence for database transactions |
| US10373168B2 (en) * | 2015-01-12 | 2019-08-06 | Mastercard International Incorporated | Method and system for retry processing of controlled payment transactions |
| SG10201800711VA (en) * | 2018-01-26 | 2019-08-27 | Mastercard International Inc | Computer system and computer-implemented method for secure e-commerce |
-
2019
- 2019-10-30 CN CN201911051855.6A patent/CN112749175B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017084442A1 (en) * | 2015-11-20 | 2017-05-26 | 华为技术有限公司 | Mobile payment method and apparatus |
| CN109063027A (en) * | 2018-07-16 | 2018-12-21 | 阿里巴巴集团控股有限公司 | A kind of method and device for business processing |
| CN109493217A (en) * | 2018-10-16 | 2019-03-19 | 翟红鹰 | Prevent method, system, equipment and the computer readable storage medium for repeating to pay |
| CN110060161A (en) * | 2019-03-28 | 2019-07-26 | 众安信息技术服务有限公司 | It trades anti-heavy client service implementation method and serviced component for block chain |
| CN110264648A (en) * | 2019-05-10 | 2019-09-20 | 杭州米雅信息科技有限公司 | Data processing method and device, automatic teller machine and data processing system |
Non-Patent Citations (1)
| Title |
|---|
| 张亚华.互联网金融产品交易平台的设计与实现.《信息科技》.2015,(第09期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112749175A (en) | 2021-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10409837B1 (en) | Asynchronous notifications for a datastore of a distributed system | |
| US9367598B2 (en) | Merging an out of synchronization indicator and a change recording indicator in response to a failure in consistency group formation | |
| US10210043B2 (en) | System and method for performing simultaneous read and write operations in a memory | |
| US11250395B2 (en) | Blockchain-based transaction processing methods and apparatuses and electronic devices | |
| US20140258659A1 (en) | Protection of former primary volumes in a synchronous replication relationship | |
| CN111880956B (en) | Data synchronization method and device | |
| CN105528373A (en) | Database fault processing method, device, system and server | |
| US9697208B2 (en) | Identifying content under access control | |
| EP3905172A1 (en) | Blockchain-based invoice voiding method and apparatus, and electronic device | |
| US20160196322A1 (en) | Processing transactions in a synchronized replication system | |
| CN115277145B (en) | Distributed storage access authorization management method, system, device and readable medium | |
| CN110795447A (en) | Data processing method, data processing system, electronic device, and medium | |
| US10453136B2 (en) | Shared memory-based transaction processing | |
| CN111708787A (en) | Multi-center service data management system | |
| US8595430B2 (en) | Managing a virtual tape library domain and providing ownership of scratch erased volumes to VTL nodes | |
| US10671482B2 (en) | Providing consistency in a distributed data store | |
| WO2012101531A1 (en) | Data integrity protection in storage volumes | |
| CN112749175B (en) | Transaction processing method and device, electronic equipment and medium | |
| US20160036653A1 (en) | Method and apparatus for avoiding performance decrease in high availability configuration | |
| US20150074062A1 (en) | Capturing change data of deferred updates | |
| US10983876B2 (en) | Node management of pending and unstable operations | |
| WO2017058148A1 (en) | Executing transactions based on success or failure of the transactions | |
| CN113905092B (en) | Method, device, terminal and storage medium for determining reusable agent queue | |
| US8255648B2 (en) | Maintaining storage device backup consistency | |
| CN112783954B (en) | Data access method, device and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |