CN112785300A - Transaction request processing method and device, electronic equipment and medium - Google Patents
Transaction request processing method and device, electronic equipment and medium Download PDFInfo
- Publication number
- CN112785300A CN112785300A CN201911098793.4A CN201911098793A CN112785300A CN 112785300 A CN112785300 A CN 112785300A CN 201911098793 A CN201911098793 A CN 201911098793A CN 112785300 A CN112785300 A CN 112785300A
- Authority
- CN
- China
- Prior art keywords
- machine room
- transaction
- transaction request
- request
- serial number
- 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.)
- Pending
Links
Images
Classifications
-
- 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/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- 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/38—Payment protocols; Details thereof
-
- 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 utility model provides a transaction request processing method, including obtaining a transaction request, the transaction request includes a transaction serial number, the transaction serial number includes a machine room identification bit, determine whether there is a redirection rule for a first machine room indicated by the machine room identification bit for processing the transaction request, if there is no redirection rule or the redirection rule query fails, determine whether the first machine room is a current machine room, and if the first machine room is not the current machine room, forward the transaction request to the first machine room. The disclosure also provides a transaction request processing device, an electronic device and a computer readable storage medium.
Description
Technical Field
The disclosure relates to a transaction request processing method, a transaction request processing device, electronic equipment and a medium.
Background
In order to ensure the multi-machine room idempotent control of cross-machine room transaction requests, the related technology requires that a transaction initiator only can send a request to a specified machine room, otherwise, the transaction initiator refuses to ensure that transactions with the same serial number are processed in the same machine room. However, the inventors have found that this approach not only results in a poor user experience, but in some cases directly results in the transaction being rendered impossible.
Disclosure of Invention
One aspect of the present disclosure provides a transaction request processing method, including obtaining a transaction request, where the transaction request includes a transaction serial number, where the transaction serial number includes a machine room identification bit, determining whether a redirection rule for a first machine room indicated by the machine room identification bit and used for processing the transaction request exists, if the redirection rule does not exist or query of the redirection rule fails, determining whether the first machine room is a current machine room, and if the first machine room is not the current machine room, forwarding the transaction request to the first machine room.
Optionally, the method further includes, if the first machine room is a current machine room, querying whether a corresponding transaction record exists based on the transaction serial number, if the corresponding transaction record does not exist, processing the transaction request, and if the transaction request is a predetermined category of transaction request, generating the transaction record of the transaction serial number.
Optionally, the method further comprises synchronizing the transaction record to another machine room in the same geographic area as the current machine room.
Optionally, the method further includes, if a corresponding transaction record exists, re-determining a second machine room for processing the transaction request based on the transaction record, and if the second machine room is not the current machine room, forwarding the transaction request to the second machine room.
Optionally, the method further includes determining whether the transaction request is a repeat request based on the transaction record if the second machine room is the current machine room, and executing the transaction request if the transaction request is not a repeat request.
Optionally, the method further includes determining a redirected third machine room if a redirection rule exists, and forwarding the transaction request to the third machine room if the third machine room is not the current machine room.
Optionally, the method further includes, if the third machine room is the current machine room, querying whether a corresponding transaction record exists based on the transaction serial number, if the corresponding transaction record does not exist, processing the transaction request, and if the transaction request is a predetermined category of transaction request, generating the transaction record of the transaction serial number.
Optionally, the method further includes, if a corresponding transaction record exists, re-determining a fourth machine room for processing the transaction request based on the transaction record, and if the fourth machine room is not the current machine room, forwarding the transaction request to the fourth machine room.
Another aspect of the disclosure provides a transaction request processing apparatus including an obtaining module, a first determining module, a second determining module, and a forwarding module. The system comprises an obtaining module and a sending module, wherein the obtaining module is used for obtaining a transaction request, the transaction request comprises a transaction serial number, and the transaction serial number comprises a machine room identification position. A first determination module to determine whether there are redirection rules for a first room indicated by the room identification bit for processing the transaction request. And the second determining module is used for determining whether the first machine room is the current machine room or not if the redirection rule does not exist or the redirection rule fails to be inquired. And the forwarding module is used for forwarding the transaction request to the first machine room if the first machine room is not the current machine room.
Another aspect of the disclosure provides an electronic device comprising a processor and a memory for storing one or more computer-readable instructions, wherein the one or more computer-readable instructions, when executed by the at least one processor, cause the processor to perform the method as described above.
Another aspect of the disclosure provides a computer readable medium having stored thereon computer readable instructions that, when executed, cause a processor to perform the method as described above.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to the method provided by the embodiment of the disclosure, the transaction requests of the same transaction serial number can be processed in the same machine room when a plurality of machine rooms process the transaction requests through the redirection rule and the forwarding rule of the machine room identification bit, so that the situation of repeated transactions of the same serial number is avoided.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an exemplary application scenario of a transaction request processing method and apparatus according to an embodiment of the present disclosure;
FIG. 2 schematically shows a flow diagram of a transaction request processing method according to an embodiment of the present disclosure;
FIG. 3 schematically shows a flow diagram of a transaction request processing method according to another embodiment of the present disclosure;
FIG. 4 schematically shows a block diagram of a transaction request processing device according to an embodiment of the present disclosure; and
FIG. 5 schematically illustrates a block diagram of a computer system suitable for implementing the transaction request processing method and system according to an embodiment of the present 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 illustrative only 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 disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not 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 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 is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have 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 convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have 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.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase "a or B" should be understood to include the possibility of "a" or "B", or "a and B".
The method of the embodiment of the disclosure obtains a transaction request, where the transaction request includes a transaction serial number, the transaction serial number includes a machine room identification bit, determines whether a redirection rule for a first machine room indicated by the machine room identification bit and used for processing the transaction request exists, if the redirection rule does not exist or query of the redirection rule fails, determines whether the first machine room is a current machine room, and if the first machine room is not the current machine room, forwards the transaction request to the first machine room.
Fig. 1 schematically illustrates an application scenario of a transaction request processing method and system according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the distributed system 100 may include a plurality of nodes 110 and a network 120. Network 120 is the medium used to provide communication links between nodes 110. Network 120 may include various connection types, such as wired, wireless communication links, and so forth. The node 110 may be, for example, a dedicated computing or storage device.
According to the embodiment of the present disclosure, the plurality of nodes 110 may be disposed in different rooms, and the transaction request may be processed in each room. Different machine rooms can be arranged in the same city or in different cities across regions. Transaction request data can be processed in the distributed system 100, and the transaction request processing method of the embodiment of the present disclosure can be applied to the distributed system 100.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Fig. 2 schematically shows a flow chart of a transaction request processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S210 to S240. The method may be performed by a server of any one of the rooms in the distributed system.
In operation S210, a transaction request is obtained, where the transaction request includes a transaction serial number, and the transaction serial number includes a machine room identification bit.
For example, a character that may be set in a particular location(s) of the multi-digit characters of the transaction serial number represents a machine room identification bit. The rooms represented by different identities may be defined, e.g. 10 for a first room in a first city, 11 for a second room in the first city, 20 for a third room in a second city, 21 for a fourth room in the second city, etc.
According to embodiments of the present disclosure, the transaction requests may include non-idempotent requests and idempotent requests. Non-idempotent requests may be, for example, payments, cash-outs, purchases and sales of security assets, etc., which if repeatedly executed may result in a change in account status, such as a change in account funds. The idempotent request may be, for example, a balance inquiry request that does not result in a change in account status even if repeatedly executed.
In operation S220, it is determined whether there is a redirection rule for the first room indicated by the room identification bit for processing the transaction request.
According to the embodiment of the disclosure, the redirection rule may be manually set according to actual needs and stored in the system, or may be generated based on some other rules. For example, in the event of a failure of a first machine room, redirection rules may be set or generated such that transaction requests that should otherwise be processed by the first machine room are handed over to other machine rooms for processing.
In operation S230, if there is no redirection rule or the redirection rule query fails, it is determined whether the first machine room is the current machine room. If the current machine room is the machine room receiving the transaction request, the request may be processed in the first machine room if the machine room receiving the transaction request is the machine room determined based on the machine room identification bit, otherwise, operation S240 should be performed.
In operation S240, if the first machine room is not the current machine room, the transaction request is forwarded to the first machine room. And if the machine room receiving the transaction request is not the first machine room determined based on the machine room identification bit, forwarding the transaction request to the first machine room through the route so as to enable the transaction request to be processed in the first machine room.
The method ensures that the transaction requests of the same transaction serial number are controllably routed to the appointed computer room for processing, thereby avoiding the situation of repeated transactions. Compared with the related technology that the transaction initiator is required to only send a request to the designated machine room, and otherwise, the request is rejected, the scheme simplifies the learning and operation difficulty of the user and is more friendly to the user.
Fig. 3 schematically shows a flow chart of a transaction request processing method according to another embodiment of the present disclosure.
As shown in fig. 3, the method may include operations S301 to S312.
In operation S301, a transaction request is obtained, where the transaction request includes a transaction serial number, and the transaction serial number includes a machine room identifier.
In operation S302, it is determined whether there is a redirection rule for the first room indicated by the room identification bit for processing the transaction request. If so, operation S303 is performed to determine the redirected third room as the target room. If not, operation S304 is performed to determine that the first machine room indicated by the machine room identification bit is the target machine room.
In operation S305, it is determined whether the target room is the current room. For example, if a redirection rule exists, it is determined whether the redirected third machine room is the current machine room, and if the redirection rule does not exist, it is determined whether the first machine room indicated by the machine room identification bit is the current machine room. If the target machine room is not the current machine room, operation S306 is performed, and the transaction request is forwarded to the target machine room. If the target room is the current room, operation S307 is performed.
In operation S307, it is determined whether a transaction record corresponding to the transaction request exists. If a transaction record exists, indicating that the transaction has occurred, operation S308 is performed, otherwise, operation S312 is performed, and the transaction request is performed.
In operation S308, it is determined whether the transaction record points to the current room, and if the transaction record points to the current room, operation S310 is continued. If the transaction record points to another machine room other than the current machine room, in order to ensure the security of the system, the transaction request is preferentially handed over to the machine room where the transaction record is generated for processing, that is, operation S309 is performed, the machine room re-determined based on the transaction record is taken as the target machine room, and operation S305 is returned (or operation S306 may be directly passed to) to continue processing.
According to the embodiment of the disclosure, only the transaction records of non-idempotent requests may be recorded, or all transaction records may be recorded. The transaction records may be stored by a distributed system. For example, the transaction records may be stored via a Redis database.
In operation S310, it is determined whether the transaction request is a repeat transaction request. If so, operation S311 is performed to refuse to execute the transaction request, otherwise, operation S312 is performed to execute the transaction request.
According to the embodiment of the disclosure, the type of the transaction request can be determined, if the transaction request is a predetermined type of transaction request, for example, a non-idempotent request, the repeat operation is not allowed, and if a transaction record exists, it is determined that the newly received request is a repeat transaction request. In the case of a transaction request of another type, for example, an idempotent request, specifically, a request for inquiring detailed information of a certain transaction, it is not determined as a repeat transaction request.
According to an embodiment of the present disclosure, after executing the transaction request in operation S312, the method may further include synchronizing the transaction record to another machine room in the same region as the current machine room. For example, for the machine rooms 10 and 20 in the same city, after a transaction record is generated in any one machine room, the transaction record may be synchronized to another machine room as a backup, so that when one machine room fails, the other machine room may process the transaction request of the failed machine room.
It should be noted that fig. 3 illustrates a non-limiting embodiment, and those skilled in the art will understand that some of the operations in the operations S301 to S312 may be used independently to form a complete technical solution, and it is not necessary to implement all of the operations.
For example, on the basis of the embodiment illustrated in fig. 2, the method may further include, if the first machine room is the current machine room, querying whether a corresponding transaction record exists based on the transaction serial number, if the corresponding transaction record does not exist, processing the transaction request, and if the transaction request is a transaction request of a predetermined category, generating the transaction record of the transaction serial number. Such as the case described with reference to operations S301-S302-S304-S305-S307-S312 described in fig. 3.
For example, on the basis of the foregoing embodiment, the method may further include, if there is a corresponding transaction record, re-determining a second machine room for processing the transaction request based on the transaction record, and if the second machine room is not the current machine room, forwarding the transaction request to the second machine room. Such as the case described with reference to operations S301-S302-S304-S305-S307-S308-S309- (S305) -S306 described in fig. 3.
For example, the method may further include, based on the foregoing embodiment, if the second machine room is the current machine room, determining whether the transaction request is a repeat request based on the transaction record, and if the transaction request is not a repeat request, executing the transaction request. Such as the case described with reference to operations S301-S302-S304-S305-S307-S308-S310-S312 described in fig. 3.
For example, the method may further include, based on the embodiment illustrated in fig. 2, determining a redirected third machine room if a redirection rule exists, and forwarding the transaction request to the third machine room if the third machine room is not the current machine room. Such as the case described with reference to operations S301-S302-S303-S305-S306 described in fig. 3.
For another example, on the basis of the foregoing embodiment, the method may further include, if the third machine room is the current machine room, querying whether a corresponding transaction record exists based on the transaction serial number, if the corresponding transaction record does not exist, processing the transaction request, and if the transaction request is a predetermined type of transaction request, generating the transaction record of the transaction serial number. Such as the case described with reference to operations S301-S302-S303-S305-S307-S312 described in fig. 3.
For another example, on the basis of the foregoing embodiment, the method may further include, if there is a corresponding transaction record, re-determining a fourth machine room for processing the transaction request based on the transaction record, and if the fourth machine room is not the current machine room, forwarding the transaction request to the fourth machine room. Such as the case described with reference to operations S301-S302-S303-S305-S307-S308-S309- (S305) -S306 described in fig. 3.
Based on the same inventive concept, the present disclosure also provides a transaction request processing apparatus, and the transaction request processing apparatus according to the embodiment of the present disclosure is described below with reference to fig. 4.
Fig. 4 schematically shows a block diagram of a transaction request processing device 400 according to an embodiment of the present disclosure.
As shown in fig. 4, the apparatus 400 includes an obtaining module 410, a first determining module 420, a second determining module 430, and a forwarding module 440. The apparatus may perform various operations described above with reference to fig. 2.
The obtaining module 410, for example, performs operation S210 described above with reference to fig. 2, for obtaining a transaction request, the transaction request including a transaction serial number, the transaction serial number including a machine room identification bit.
The first determining module 420, for example, performs operation S220 described above with reference to fig. 2, for determining whether there is a redirection rule for the first room indicated by the room identification bit for processing the transaction request.
The second determining module 430, for example, performs operation S230 described above with reference to fig. 2, and is configured to determine whether the first machine room is the current machine room if there is no redirection rule or the redirection rule query fails.
The forwarding module 440, for example, performs operation S240 described above with reference to fig. 2, for forwarding the transaction request to the first machine room if the first machine room is not the current machine room.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units 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 a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any number of the obtaining module 410, the first determining module 420, the second determining module 430, and the forwarding module 440 may be combined in one module to be implemented, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the obtaining module 410, the first determining module 420, the second determining module 430, and the forwarding module 440 may be implemented at least partially 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 in any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in any suitable combination of any of them. Alternatively, at least one of the obtaining module 410, the first determining module 420, the second determining module 430 and the forwarding module 440 may be at least partially implemented as a computer program module, which when executed may perform a corresponding function.
FIG. 5 schematically illustrates a block diagram of a computer system suitable for implementing the transaction request processing method and apparatus according to an embodiment of the present disclosure. The computer system illustrated in FIG. 5 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure. The computer system shown in fig. 5 may be implemented as a server cluster including at least one processor (e.g., processor 501) and at least one memory (e.g., storage portion 508).
As shown in fig. 5, a computer system 500 according to an embodiment of the present disclosure includes a processor 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 503, various programs and data necessary for the operation of the system 500 are stored. The processor 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the programs may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, system 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The system 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable medium, which may be embodied in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer readable medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, a computer readable medium may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, 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), an optical fiber, 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 present 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. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, optical fiber cable, radio frequency signals, etc., or any suitable combination of the foregoing.
For example, according to embodiments of the present disclosure, a computer-readable medium may include ROM 502 and/or RAM 503 and/or one or more memories other than ROM 502 and RAM 503 described above.
The flowchart 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 various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (11)
1. A transaction request processing method, comprising:
obtaining a transaction request, wherein the transaction request comprises a transaction serial number, and the transaction serial number comprises a machine room identification position;
determining whether a redirection rule for a first room indicated by the room identification bit for processing the transaction request exists;
if the redirection rule does not exist or the redirection rule fails to be inquired, determining whether the first machine room is the current machine room; and
and if the first machine room is not the current machine room, forwarding the transaction request to the first machine room.
2. The method of claim 1, further comprising:
if the first machine room is the current machine room, inquiring whether a corresponding transaction record exists or not based on the transaction serial number;
and if the corresponding transaction record does not exist, processing the transaction request, and generating the transaction record of the transaction serial number under the condition that the transaction request is a transaction request of a preset category.
3. The method of claim 2, further comprising:
synchronizing the transaction record to another machine room in the same region as the current machine room.
4. The method of claim 2, further comprising:
if the corresponding transaction record exists, re-determining a second machine room for processing the transaction request based on the transaction record;
and if the second machine room is not the current machine room, forwarding the transaction request to the second machine room.
5. The method of claim 4, further comprising:
if the second machine room is the current machine room, determining whether the transaction request is a repeated request based on the transaction record;
executing the transaction request if the transaction request is not a repeat request.
6. The method of claim 1, further comprising:
if the redirection rule exists, determining a redirected third machine room;
and if the third machine room is not the current machine room, forwarding the transaction request to the third machine room.
7. The method of claim 6, further comprising:
if the third machine room is the current machine room, inquiring whether a corresponding transaction record exists or not based on the transaction serial number;
and if the corresponding transaction record does not exist, processing the transaction request, and generating the transaction record of the transaction serial number under the condition that the transaction request is the transaction request of the preset category.
8. The method of claim 7, further comprising:
if the corresponding transaction record exists, re-determining a fourth machine room for processing the transaction request based on the transaction record;
and if the fourth machine room is not the current machine room, forwarding the transaction request to the fourth machine room.
9. A transaction request processing apparatus comprising:
the system comprises an obtaining module, a processing module and a processing module, wherein the obtaining module is used for obtaining a transaction request, the transaction request comprises a transaction serial number, and the transaction serial number comprises a machine room identification position;
a first determination module for determining whether there is a redirection rule for a first room indicated by the room identification bit for processing the transaction request;
the second determining module is used for determining whether the first machine room is the current machine room or not if the redirection rule does not exist or the redirection rule fails to be inquired; and
and the forwarding module is used for forwarding the transaction request to the first machine room if the first machine room is not the current machine room.
10. An electronic device, comprising:
one or more processors;
a memory for storing one or more computer programs,
wherein the one or more computer 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 8.
11. A computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of any one of claims 1 to 8.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911098793.4A CN112785300A (en) | 2019-11-11 | 2019-11-11 | Transaction request processing method and device, electronic equipment and medium |
| PCT/CN2020/128193 WO2021093784A1 (en) | 2019-11-11 | 2020-11-11 | Transaction request processing method and device, electronic device, and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911098793.4A CN112785300A (en) | 2019-11-11 | 2019-11-11 | Transaction request processing method and device, electronic equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112785300A true CN112785300A (en) | 2021-05-11 |
Family
ID=75749860
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911098793.4A Pending CN112785300A (en) | 2019-11-11 | 2019-11-11 | Transaction request processing method and device, electronic equipment and medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112785300A (en) |
| WO (1) | WO2021093784A1 (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108415792A (en) * | 2018-01-15 | 2018-08-17 | 阿里巴巴集团控股有限公司 | Disaster tolerance system, method, apparatus and equipment |
| CN109508912A (en) * | 2018-12-29 | 2019-03-22 | 广州虎牙信息科技有限公司 | A kind of business scheduling method, device, equipment and storage medium |
| CN109727036A (en) * | 2018-05-14 | 2019-05-07 | 网联清算有限公司 | Transaction processing method and its device |
| CN110266747A (en) * | 2019-04-12 | 2019-09-20 | 阿里巴巴集团控股有限公司 | The computer room forwarding method and device of service request |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9613190B2 (en) * | 2014-04-23 | 2017-04-04 | Intralinks, Inc. | Systems and methods of secure data exchange |
| CN110213365B (en) * | 2019-05-30 | 2021-02-26 | 掌阅科技股份有限公司 | User access request processing method based on user partition and electronic equipment |
| CN110443593B (en) * | 2019-08-07 | 2023-11-21 | 网联清算有限公司 | Transaction processing method and device, transaction processing system and computer system |
-
2019
- 2019-11-11 CN CN201911098793.4A patent/CN112785300A/en active Pending
-
2020
- 2020-11-11 WO PCT/CN2020/128193 patent/WO2021093784A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108415792A (en) * | 2018-01-15 | 2018-08-17 | 阿里巴巴集团控股有限公司 | Disaster tolerance system, method, apparatus and equipment |
| CN109727036A (en) * | 2018-05-14 | 2019-05-07 | 网联清算有限公司 | Transaction processing method and its device |
| CN109508912A (en) * | 2018-12-29 | 2019-03-22 | 广州虎牙信息科技有限公司 | A kind of business scheduling method, device, equipment and storage medium |
| CN110266747A (en) * | 2019-04-12 | 2019-09-20 | 阿里巴巴集团控股有限公司 | The computer room forwarding method and device of service request |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021093784A1 (en) | 2021-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109918040B (en) | Voice instruction distribution method and device, electronic equipment and computer readable medium | |
| CN109995877B (en) | Information pushing method and device | |
| CN108520454A (en) | The method and system of readjustment order in real time | |
| CN109886693B (en) | Consensus realization method, device, equipment and medium for block chain system | |
| US20170024396A1 (en) | Determining application deployment recommendations | |
| CN110324185B (en) | Hyper-parameter tuning method, device, server, client and medium | |
| CN110401630B (en) | Transaction certificate verification method, device, electronic equipment and medium | |
| CN110874227A (en) | Shunting method and system for realizing gray scale release of API gateway and electronic equipment | |
| CN111556153B (en) | Information processing method, apparatus, device and medium executed by first server | |
| CN108900562B (en) | Login state sharing method and device, electronic equipment and medium | |
| CN109325744B (en) | Payment processing method, payment processing device, payment processing medium and electronic equipment | |
| CN109669787B (en) | Data transmission method and device, storage medium and electronic equipment | |
| CN112918487B (en) | Unmanned vehicle starting method and device, electronic equipment and computer readable medium | |
| CN112328244A (en) | Method for displaying page configuration, server, terminal equipment and electronic equipment | |
| KR102553877B1 (en) | A method and system for efficiently processing the high transaction throughput required by DApps in the blockchain | |
| CN112822430B (en) | Conference group merging method and device | |
| CN113656307A (en) | System capacity evaluation method, device, equipment and medium | |
| CN110968433A (en) | Information processing method and system and electronic equipment | |
| CN113014650B (en) | Processing method and device for data request, computing equipment and medium | |
| CN112785300A (en) | Transaction request processing method and device, electronic equipment and medium | |
| KR20170062235A (en) | System and method for processing service | |
| CN112764897B (en) | Task request processing method, device and system and computer readable storage medium | |
| CN105335362A (en) | Real-time data processing method and system, and instant processing system | |
| CN109976902B (en) | Task processing method, system, electronic device and computer readable medium | |
| US20170286181A1 (en) | Deployment and execution of sensing and computational tasks in a network of computing devices |
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 |