Order processing method and device, equipment, storage medium and program product

Abstract

The invention provides an order processing method and device, equipment, a storage medium and a program product, which can be applied to the technical field of computers. The method comprises the following steps: filtering target order parameters in a to-be-processed order message to obtain a target order message; performing n times of hash processing on the target order message to obtain n hash values, n being a positive integer; positioning n target point locations from a plurality of point locations of a bitmap structure according to the n hash values, the bitmap structure storing transaction failure records of the order message through the values of the point locations; and in response to the value of the target point location representing that the target order message has a transaction failure record, intercepting a to-be-processed order message associated with the target order message.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and more specifically, to an order processing method, apparatus, device, storage medium, and program product. Background Technology

[0002] With the rapid development of computer technology, an increasing number of transactions are being conducted online. For example, demanders can connect their own order submission systems with the order processing systems of suppliers. During this connection process, users can submit bulk orders to the order processing system through their own order submission systems. Subsequently, the order processing system can use a third-party routing system to further send these bulk orders to the transaction system for processing.

[0003] In realizing the inventive concept disclosed herein, the inventors discovered the following problems in related technologies: Before sending batch transaction orders to a transaction system, it is generally necessary to verify the transaction parameters of the batch transaction orders. If the transaction parameter verification fails, the order submission system will generally automatically generate a new order number and resubmit the order while keeping other transaction parameters unchanged. However, not all orders can be completed after resubmission. As a result, the order submission system continuously generates new orders, leading to a large amount of data redundancy and invalid resource consumption, thus putting multiple storage pressures on the multiple systems conducting order transactions. This not only reduces resource utilization but also reduces order processing efficiency. Summary of the Invention

[0004] In view of this, the present disclosure provides an order processing method, apparatus, device, storage medium, and program product for improving resource utilization and order processing efficiency.

[0005] One aspect of this disclosure provides an order processing method, the method comprising: filtering target order parameters in an order message to be processed to obtain a target order message; performing n hash operations on the target order message to obtain n hash values, where n is a positive integer; locating n target positions from multiple positions of a bitmap structure based on the n hash values, wherein the bitmap structure stores transaction failure records of the order message through the values ​​of the positions; and intercepting the order message to be processed associated with the target order message in response to the value of the target position indicating that there is a transaction failure record in the target order message.

[0006] According to embodiments of this disclosure, the bitmap structure includes a first bitmap structure and a second bitmap structure. The first bitmap structure stores transaction records associated with whether transaction parameter verification failed when the target order message is transacted. The second bitmap structure stores transaction records associated with whether an anomaly occurred in the transaction system transacting the target order message. The interception of the pending order message associated with the target order message, in response to the value of the target bit indicating a transaction failure record in the target order message, includes: intercepting the pending order message associated with the target order message in response to the value of the target bit in the first bitmap structure; and intercepting the pending order message associated with the target order message based on the number of transaction failure records in response to the value of the target bit in the second bitmap structure indicating a transaction failure record in the target order message.

[0007] According to embodiments of this disclosure, the interception of the pending order message associated with the target order message based on the number of transaction failure records includes: obtaining order timestamps associated with the target order message within a first time period, wherein the end time of the first time period includes the submission time when the order submission system submits the pending order message; generating the number of transaction failures for the target order message based on the number of order timestamps; and intercepting the pending order message associated with the target order message in response to the number of transaction failures exceeding a preset threshold.

[0008] According to an embodiment of this disclosure, the method further includes: in response to the number of transaction failures exceeding the preset threshold, storing the feature information in the target order message into a list structure; during a second time period, restricting the order submission system from submitting order messages with the same feature information as the target order message, wherein the starting time of the second time period includes the order message submission time associated with the situation where the number of transaction failures reaches the preset threshold.

[0009] According to an embodiment of this disclosure, the method further includes: responding to the value of the target point indicating that there is no transaction failure record in the target order message, trading the target order message with the transaction system through the routing system; and adjusting the value of the target point in the bitmap structure according to the transaction result of trading the target order message.

[0010] According to an embodiment of this disclosure, adjusting the value of the target point in the bitmap structure based on the transaction result of the target order message includes: in response to the transaction result indicating that the transaction parameter verification of the target order message has failed, adjusting the value of the target point associated with the target order message to a first preset value in the first bitmap structure.

[0011] According to an embodiment of this disclosure, adjusting the value of the target point in the bitmap structure based on the transaction result of the target order message further includes: in response to the transaction result indicating an anomaly in the transaction system, adjusting the value of the target point associated with the target order message to the first preset value in the second bitmap structure; and storing the user identifier and the order timestamp of the target order message in the target order message using a hash structure.

[0012] According to an embodiment of this disclosure, the method of locating n target points from multiple points in a bitmap structure based on the n hash values ​​includes: obtaining the total number of points contained in the bitmap structure; performing modulo operations on the n hash values ​​and the total number of points respectively to obtain n modulo results; and locating the target points in the bitmap structure based on the points corresponding to the n modulo results.

[0013] According to an embodiment of this disclosure, the above-mentioned filtering of the target order parameters in the order message to be processed to obtain the target order message includes: identifying the order message to be processed to obtain the target order parameters, wherein the target order parameters include an order identifier and an order submission time; filtering out the order identifier and the order submission time from the order message to be processed to obtain the target order message.

[0014] According to embodiments of this disclosure, the method further includes: generating an intercept message in response to intercepting the pending order message; and sending the intercept message to the order submission system.

[0015] Another aspect of this disclosure provides an order processing apparatus, comprising: a filtering module for filtering target order parameters in an order message to be processed to obtain a target order message; a processing module for performing n hash operations on the target order message to obtain n hash values, where n is a positive integer; a positioning module for locating n target positions from multiple positions of a bitmap structure based on the n hash values, wherein the bitmap structure stores transaction failure records of the order message through the values ​​of the positions; and an interception module for intercepting the order message to be processed associated with the target order message in response to the value of the target position indicating that the target order message has a transaction failure record.

[0016] Another aspect of this disclosure provides an electronic device, including: one or more processors; and a memory for storing one or more programs, which, when executed by the one or more processors, cause the one or more processors to implement the order processing method described above.

[0017] Another aspect of this disclosure provides a computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, cause the processor to implement the order processing method described above.

[0018] Another aspect of this disclosure provides a computer program product, including a computer program that, when executed by a processor, implements the order processing method described above.

[0019] According to embodiments of this disclosure, a target order message is obtained by filtering the target order parameters in the order message to be processed; the target order is hashed n times to obtain n hash values; based on the n hash values, n target positions are located from multiple positions in the bitmap structure; in response to the value of the target position indicating that the target order message has a transaction failure record, the order message to be processed associated with the target order message is intercepted. Since the target order message is hashed during order processing, and the existence of a transaction failure record in the target order message is obtained from the bitmap structure based on the hash value, if such a record exists, the order message to be processed is intercepted. This at least partially overcomes the high resource storage pressure caused by constantly re-placing orders. Furthermore, storing order transaction information through a bitmap structure can reduce the memory usage of transaction orders; determining the target positions through n hash values ​​can avoid the problem of difficulty in accurately determining the target positions due to insufficient or excessive positions, thereby improving the accuracy of determining the target positions. Overall, the order processing method, apparatus, equipment, storage medium, and program products provided in the embodiments of this disclosure can achieve the technical effects of improving resource utilization and order processing efficiency. Attached Figure Description

[0020] The above and other objects, features and advantages of this disclosure will become clearer from the following description of embodiments with reference to the accompanying drawings, in which:

[0021] Figure 1 An exemplary system architecture to which order processing methods can be applied according to embodiments of this disclosure is illustrated;

[0022] Figure 2 schematically illustrates a flowchart of an order processing method according to an embodiment of the present disclosure;

[0023] Figure 3 This schematic diagram illustrates the structure of the first figure according to an embodiment of the present disclosure;

[0024] Figure 4A A schematic diagram illustrating an order processing method according to an embodiment of the present disclosure is shown.

[0025] Figure 4B Schematic illustration Figure 4A A framework diagram for determining whether there are failed order transaction records;

[0026] Figure 5 A flowchart illustrating an order processing method according to another embodiment of the present disclosure is shown schematically;

[0027] Figure 6 A block diagram schematically illustrates an order processing apparatus according to embodiments of the present disclosure; and

[0028] Figure 7 A block diagram of an electronic device suitable for implementing the order processing method described above, according to an embodiment of the present disclosure, is shown schematically. Detailed Implementation

[0029] The embodiments of the present disclosure will now be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the disclosure. In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the embodiments of the present disclosure for ease of explanation. However, it will be apparent that one or more embodiments may be practiced without these specific details. Furthermore, descriptions of well-known structures and techniques are omitted in the following description to avoid unnecessarily obscuring the concepts of the present disclosure.

[0030] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit this disclosure. The terms “comprising,” “including,” etc., as used herein indicate the presence of the stated features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

[0031] All terms used herein (including technical and scientific terms) have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein are to be interpreted in a manner consistent with the context of this specification, and not in an idealized or overly rigid way.

[0032] When using expressions such as "at least one of A, B and C", they should generally be interpreted in accordance with the meaning that is commonly understood by those skilled in the art (e.g., "a system having at least one of A, B and C" should include, but is not limited to, a system having A alone, a system having B alone, a system having C alone, a system having A and B, a system having A and C, a system having B and C, and / or a system having A, B and C, etc.).

[0033] In the embodiments of this disclosure, the collection, updating, analysis, processing, use, transmission, provision, disclosure, and storage of data (e.g., including but not limited to user personal information) comply with relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. In particular, necessary measures have been taken to prevent unauthorized access to user personal information data and to safeguard user personal information security, network security, and national security. In the embodiments of this disclosure, user authorization or consent has been obtained before acquiring or collecting user personal information.

[0034] Currently, the order processing process typically involves users submitting orders to an order processing system through their own order submission system, which automatically generates an order number. Upon receiving the order, the order processing system transmits the order data to a third-party routing system to verify the order's transaction parameters. The third-party routing system verifies the transaction parameters sent by the order processing system, such as basic required order information, according to the transaction rules of the transaction system. If verification is successful, the third-party routing system forwards the order information to the transaction system and stores the order information and processing result in its database. Upon receiving a notification of successful order processing, the order processing system records the relevant order information and processing result, and the process ends. If verification fails, the order processing fails, and the order processing system does not record any relevant information. In this case, the order submission system can automatically generate a new order number and resubmit the order, but other transaction parameters remain unchanged. The third-party routing system continues to verify the order's transaction parameters until the order is successfully processed or the user selects another processing method. In one example, the transaction system can process the pending order message, and the third-party routing system can record the transaction result. The order processing system can determine whether an order was successfully placed. If successful, it records the order result and sends it back to the order submission system. If the order fails, it also sends a response to the order submission system. The order submission system determines whether the order was successfully placed. If successful, it records the order result. If the order fails, it changes the order number and resubmits the order. The framework of this technology does not involve the process of judging or intercepting resubmitted orders.

[0035] In the order processing process described above, the order submission system can automatically generate a new order number and resubmit the order. However, resubmitting the order will not ensure successful processing in the following two situations: one is when the order's transaction parameters fail to be validated, such as when the contact person's contact information is missing; the other is when the transaction system malfunctions. In these two cases, regenerating the order may not guarantee successful processing. Therefore, when the order submission system fails to process an order due to transaction parameter validation failure or a transaction system malfunction, the resulting duplicate order placement by manually changing the order number and order placement time leads to significant data redundancy and unnecessary resource consumption. This puts pressure on the CPU (Central Processing Unit), network I / O (Input / Output), database I / O, and storage resources of the order processing system and the third-party routing system, reducing both resource utilization and order processing efficiency.

[0036] In view of this, embodiments of this disclosure provide an order processing method, apparatus, device, storage medium, and program product to effectively alleviate the pressure on these systems, reduce invalid interactions with transaction systems, and improve resource utilization, order processing efficiency, and stability of the entire order processing process. Specifically, the method may include: filtering target order parameters in an order message to be processed to obtain a target order message; performing n hash operations on the target order message to obtain n hash values, where n is a positive integer; locating n target points from multiple points in a bitmap structure based on the n hash values, wherein the bitmap structure stores transaction failure records of the order message through the values ​​of the points; and intercepting the order message to be processed associated with the target order message in response to the value of the target point indicating that there is a transaction failure record in the target order message.

[0037] Figure 1 An exemplary system architecture 100 to which an order processing method can be applied according to embodiments of this disclosure is illustrated schematically. It should be noted that... Figure 1 The examples shown are merely examples of system architectures that can be applied to the embodiments of this disclosure, in order to help those skilled in the art understand the technical content of this disclosure, but do not mean that the embodiments of this disclosure cannot be used in other devices, systems, environments or scenarios.

[0038] like Figure 1As shown, the system architecture 100 according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the first terminal device 101, the second terminal device 102, the third terminal device 103, and the server 105. The network 104 may include various connection types, such as wired and / or wireless communication links, etc.

[0039] Users can use the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 via the network 104 to receive or send messages, such as sending pending order messages or receiving the processing results of pending order messages. Various communication client applications can be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, and / or social media platform software (for example only).

[0040] The first terminal device 101, the second terminal device 102, and the third terminal device 103 can be various electronic devices with displays and support web browsing, including but not limited to smartphones, tablets, laptops, and desktop computers.

[0041] Server 105 can be a server that provides various services, such as a back-end management server that supports pending order messages sent by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103 (this is just an example). The back-end management server can analyze and process the received user requests and other data, and feed back the processing results (such as order processing results, web pages, information, or data obtained or generated according to user requests) to the terminal devices.

[0042] It should be noted that the order processing method provided in this embodiment can generally be executed by server 105. Correspondingly, the order processing device provided in this embodiment can generally be located in server 105. The order processing method provided in this embodiment can also be executed by a server or server cluster that is different from server 105 and capable of communicating with the first terminal device 101, the second terminal device 102, the third terminal device 103, and / or server 105. Correspondingly, the order processing device provided in this embodiment can also be located in a server or server cluster that is different from server 105 and capable of communicating with the first terminal device 101, the second terminal device 102, the third terminal device 103, and / or server 105. Alternatively, the order processing method provided in this embodiment can also be executed by the first terminal device 101, the second terminal device 102, or the third terminal device 103, or by other terminal devices different from the first terminal device 101, the second terminal device 102, or the third terminal device 103. Accordingly, the order processing device provided in this embodiment may also be disposed in the first terminal device 101, the second terminal device 102 or the third terminal device 103, or disposed in other terminal devices different from the first terminal device 101, the second terminal device 102 or the third terminal device 103.

[0043] For example, the order message to be processed may originally be stored in any one of the first terminal device 101, the second terminal device 102, or the third terminal device 103 (e.g., the first terminal device 101, but not limited thereto), or it may be stored on an external storage device and imported into the first terminal device 101. Then, the first terminal device 101 may execute the order processing method provided in the embodiments of this disclosure locally, or send the order to be processed to other terminal devices, servers, or server clusters, and have the other terminal devices, servers, or server clusters that receive the order to be processed execute the order processing method provided in the embodiments of this disclosure.

[0044] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0045] Current order processing systems typically store information about successfully completed transactions. Therefore, when an order submission system retryes after a transaction fails and the order number is changed, the order processing system struggles to determine if it's a retry of a failed order (including failed orders due to transaction parameter verification failures or system anomalies). This means that if the order submission system retryes 10 times, the order processing system will send 10 processing requests to downstream systems (such as third-party routing systems or transaction systems). This repeated order placement not only increases unnecessary resource consumption but may also put unnecessary pressure on downstream systems. In view of this, embodiments of this disclosure provide an order processing method, apparatus, device, storage medium, and program product to solve the above problems. The following will describe the order processing method, apparatus, device, storage medium, and program product provided by embodiments of this disclosure.

[0046] Figure 2 A flowchart illustrating an order processing method according to an embodiment of the present disclosure is shown schematically.

[0047] like Figure 2 As shown, the method includes operations S210 to S240.

[0048] In operation S210, the target order parameters in the order message to be processed are filtered to obtain the target order message.

[0049] In operation S220, the target order message is hashed n times to obtain n hash values, where n is a positive integer.

[0050] In operation S230, based on n hash values, n target points are located from multiple points in the bitmap structure. The bitmap structure stores transaction failure records of order messages through the values ​​of the points.

[0051] In operation S240, in response to the value of the target point indicating that there is a transaction failure record in the target order message, the pending order message associated with the target order message is intercepted.

[0052] Optionally, users can submit pending order messages through their own order submission system when placing an order. Pending order messages may include order parameters such as order number, order submission time, item name, item type, item model, item quantity, and contact information for the order's contact parties (e.g., the party that initiated the order, the party that will receive the items). Target order parameters may include the order number and the order submission time.

[0053] Optionally, the order processing system can filter out the order number and order submission time from the pending order messages, retaining only the remaining order parameters, and the resulting order message can be used as the target order message.

[0054] Optionally, the order processing system can perform n hash operations on the target order message to obtain n hash values. In one embodiment, n can be greater than or equal to 2, and n is preferably 3, that is, the target order message is hashed 3 times. For example, three different hash algorithms can be selected to process the target order message respectively to obtain three different hash values. In another example, one hash algorithm can also be selected to process the target order message to obtain a first hash value, and then use the same hash algorithm to process the first hash value to obtain a second hash value; then use the same hash algorithm to process the second hash value to obtain a third hash value. The hash algorithm can be a common hash algorithm in related technologies, and the specific hash processing process can be adaptively adjusted according to actual needs.

[0055] Optionally, the bitmap structure can be a structure used to store order transaction failure records. The bitmap structure can include multiple bits, each configured with a value. When the value of a bit is a first preset value (e.g., 1), it indicates that the order transaction has failed; when the value of a bit is a second preset value (e.g., 0), it indicates that the order has not failed and can be submitted to the transaction system (e.g., a logistics processing system). Each user can have their own bitmap structure, which minimizes misjudgments caused by different users having the same hash value.

[0056] Optionally, after the order processing system processes the target order message to obtain three hash values, it can use the bitmap structure of the distributed cache of these three hash values ​​(e.g., Redis's distributed cache) to search for whether there is a record of the target order message transaction failure. In one embodiment, in response to the obtained three hash values, the system can search the bitmap structure for the points represented by these three hash values. If the values ​​of these points are all 1, it indicates that the target order message exists in the bitmap structure and the target order message transaction has failed; if these points are not found or the values ​​of these points are not all 1 or are all 0, it indicates that the target order transaction does not exist in the bitmap structure or the target order transaction has succeeded.

[0057] According to embodiments of this disclosure, Redis is chosen as the caching database to ensure data consistency in a clustered environment. Bitmap structures offer advantages such as low memory footprint, fast operation speed, and support for dynamic expansion, making them an ideal choice for processing large amounts of data while minimizing memory consumption. In one embodiment, by performing hash processing on the order message to be processed at least twice, the problem of inaccurate target location caused by insufficient or excessive bits in the bitmap structure can be avoided, thereby improving the accuracy of target location.

[0058] Optionally, in the bitmap structure, the target point can be a point associated with the hash value of the target order message. In response to the value of the target point indicating that there is a transaction failure record in the target order message, the pending order messages associated with the target order message can be intercepted. This can prevent the order submission system from regenerating the order number and retrying the order for the failed transaction, thereby reducing resource consumption and improving resource utilization.

[0059] According to embodiments of this disclosure, a target order message is obtained by filtering the target order parameters in the order message to be processed; the target order is hashed n times to obtain n hash values; based on the n hash values, n target positions are located from multiple positions in the bitmap structure; in response to the value of the target position indicating that the target order message has a transaction failure record, the order message to be processed associated with the target order message is intercepted. Since the target order message is hashed during order processing, and the existence of a transaction failure record in the target order message is obtained from the bitmap structure based on the hash value, if such a record exists, the order message to be processed is intercepted. This at least partially overcomes the high resource storage pressure caused by constantly re-placing orders. Furthermore, storing order transaction information through a bitmap structure can reduce the memory usage of transaction orders; determining the target positions through n hash values ​​can avoid the problem of difficulty in accurately determining the target positions due to insufficient or excessive positions, thereby improving the accuracy of determining the target positions. Overall, the order processing method, apparatus, equipment, storage medium, and program products provided in the embodiments of this disclosure can achieve the technical effects of improving resource utilization and order processing efficiency.

[0060] Optionally, since the order submission system can automatically generate a new order number for failed orders and retry submitting the order, and the order processing system has difficulty identifying whether the new order number indicates a failed order, in order to determine whether the order needs to be blocked, the order number and the order submission time can be temporarily removed before proceeding with subsequent operations S220~S240.

[0061] In one embodiment, the above operation S210 can filter the order number and the order submission time. Operation S210 may include the following operations: identifying the order message to be processed to obtain the target order parameters, wherein the target order parameters include the order identifier and the order submission time; filtering out the order identifier and the order submission time from the order message to be processed to obtain the target order message.

[0062] Optionally, by identifying the order parameters on the order to be processed and temporarily filtering out the identified target order parameters, including the order number and the order submission time, the target order message can be obtained. The filtered order number can be restored when generating the intercept message. This operation ensures that even if the order submission system changes the order number and order submission time to retry due to order transaction failure, the order processing system can still intercept failed orders, at least partially avoiding the high resource storage pressure caused by multiple order retries, thereby improving resource utilization and order processing efficiency.

[0063] Optionally, the process of locating n target points from multiple points in a bitmap structure based on n hash values, as described in operation S230 above, may include the following operations: obtaining the total number of points contained in the bitmap structure; performing modulo operations on the n hash values ​​and the total number of points respectively to obtain n modulo results; and locating the target points in the bitmap structure based on the points corresponding to the n modulo results.

[0064] Optionally, the bitmap structure in this embodiment of the disclosure may include a first bitmap structure and a second bitmap structure. The first bitmap structure may be used to store transaction records associated with whether the transaction parameter verification failed when the target order message is transacted; the second bitmap structure may be used to store transaction records associated with whether an anomaly occurred in the transaction system of the target order message.

[0065] In one embodiment, the process of locating the target point is described using the first bitmap structure as an example. The process of locating the target point in the second bitmap structure can refer to the first bitmap structure.

[0066] Figure 3 The diagram illustrates a schematic representation of the structure of the first figure according to an embodiment of the present disclosure.

[0067] like Figure 3 As shown, the total number of points in the first graph structure can be 1 million. Figure 3 The diagram only shows 10 points, numbered 0 to 9. Each point can have an initial value of 0. After hashing the target order message n times to obtain n hash values, these n hash values ​​are moduloed by the total number of points (1 million), resulting in n modulo results, which can be any numbers from 0 to 9. Based on these n modulo results, n target points are located.

[0068] like Figure 3 As shown, in one embodiment, the n modulo results can be 2, 3, and 5, numbered 0-9. Figure 3In the diagram, points numbered 2, 3, and 5 are the target points. If the values ​​of points numbered 2, 3, and 5 are all 1, it means that data matching the target order message has been found, indicating that the target order message has previously failed in trading. If the values ​​of points numbered 2, 3, and 5 are not all 1, but some or all are 0, it indicates that no data matching the target order message has been found, the target order message has not previously failed in trading, and the target order message can be submitted to the trading system.

[0069] Alternatively, this method allows for efficient searching or setting of points within the bitmap structure, enabling rapid processing of large volumes of order data and ensuring the temperature and reliability of the order processing process.

[0070] Optionally, the process described above for intercepting pending order messages associated with the target order message in response to the value of the target point indicating that the target order message has a transaction failure record may include the following operations: in response to the value of the target point in the first bitmap structure, indicating that the target order message has a transaction failure record, intercepting pending order messages associated with the target order message; in response to the value of the target point in the second bitmap structure, indicating that the target order message has a transaction failure record, intercepting pending order messages associated with the target order message based on the number of transaction failure records.

[0071] Optionally, in one embodiment, after obtaining the hash value, the target position can be located in the first bitmap structure. If the value of the target position in the first bitmap structure indicates that there is a transaction failure record in the target order message associated with the hash value, the pending order message associated with the target order message can be directly intercepted. If the value of the target position in the first bitmap structure indicates that there is no transaction failure record in the target order message associated with the hash value, the target position associated with the hash value can be located in the second bitmap structure. If the value of the target position in the second bitmap structure indicates that there is a transaction failure record in the target order message, the interception can be further performed based on the number of transaction failure records. If the value of the target position in the second bitmap structure indicates that there is no transaction failure record in the target order message, the target order message can be sent to the transaction processing system for further processing.

[0072] Optionally, in another embodiment, after obtaining the hash value, the target point can be located in both the first bitmap structure and the second bitmap structure. If the value of the target point in both the first bitmap structure and the second bitmap structure indicates that there is no record of transaction failure in the target order message associated with the hash value, then the target order message can be sent to the transaction processing system for further processing.

[0073] Optionally, in another embodiment, after obtaining the hash value, the target position can be located in the second bitmap structure first. If the value of the target position associated with the hash value in the second bitmap structure indicates that the target order message has a transaction failure record, then further interception can be performed based on the number of transaction failure records. If the value of the target position associated with the hash value in the second bitmap structure indicates that the target order message does not have a transaction failure record, the target position can be located in the first bitmap structure. If the value of the target position in the first bitmap structure indicates that the target order message associated with the hash value has a transaction failure record, then the pending order message associated with the target order message can be directly intercepted. If the value of the target position in the first bitmap structure indicates that the target order message associated with the hash value does not have a transaction failure record, then the target order message can be sent to the transaction processing system for further processing.

[0074] According to embodiments of this disclosure, the first bitmap structure can store order transaction failure records associated with transaction parameter verification failures, such as order transaction failures due to incomplete contact information of the order contact person. In this case, no matter how many times it is retried, it may still fail. Therefore, if order transaction failure records exist in the first bitmap structure, the order can be directly intercepted. The second bitmap structure can store order transaction failure records associated with transaction system anomalies, such as transaction system anomalies caused by network disconnection, leading to order transaction failures. In this case, retrying is allowed. Therefore, if order transaction failure records exist in the second bitmap structure, the order can be further intercepted based on the number of order transaction failures. In this way, different interception methods are used for different transaction failure situations, which not only improves the user experience but also improves order processing efficiency, effectively completing the pending orders submitted by users.

[0075] Optionally, the process described above for intercepting pending order messages associated with a target order message based on the number of transaction failure records may include the following operations: obtaining order timestamps associated with the target order message within a first time period, wherein the end time of the first time period includes the submission time when the order submission system submits the pending order message; generating the number of transaction failures for the target order message based on the number of order timestamps; and intercepting pending order messages associated with the target order message in response to the number of transaction failures exceeding a preset threshold.

[0076] Optionally, the above interception method may further include the following operations: in response to the number of transaction failures exceeding a preset threshold, storing the feature information in the target order message into a list structure; during a second time period, restricting the order submission system from submitting order messages with the same feature information as the target order message, wherein the starting time of the second time period includes the order message submission time associated with the situation where the number of transaction failures reaches the preset threshold.

[0077] Optionally, embodiments of this disclosure may use a Redis hash structure to store a user's order transaction failure records within the last 24 hours. The user's unique identifier (e.g., the identifier the user registered with in the order processing system) may be used as the key of the hash structure, and the order timestamp of the order message (e.g., the timestamp at the time of order submission) may be used as the field of the hash structure.

[0078] When a user's pending order transaction fails, it can be recorded in the corresponding hash structure. The order timestamp of the pending order is used as the field value, and it is stored as 1. This makes it easy to count the number of failed orders for each user.

[0079] In the second bitmap structure, if the target point represents a failed order transaction, it's possible to check whether the user's number of failed order transactions (i.e., the number of failed order placements) exceeds the limit. The number of failed order placements per minute can be calculated by iterating through the hash structure of each customer and counting the value of each field, i.e., the number of order timestamps, which can be directly used as the number of failed order transactions.

[0080] For example, if the same user's same order (e.g., all order parameters are the same except for the order number and submission time) fails more than a preset threshold (e.g., 3 times) within 1 minute (i.e., the first time period, 1 minute before the submission time of the pending order message), then verification upgrades are required, and a restriction can be implemented that prevents the same user from placing the same order again within 3 minutes (i.e., the second time period, 3 minutes after the timestamp of the 3rd failed transaction). In this embodiment, a Redis list structure can be used to record characteristic information in the target order message (e.g., the unique identifiers of these restricted users and the order parameters). Whenever a new order request arrives, the unique identifier and order parameters of the user can be checked first to see if they are in the restriction list. If they are, the request is rejected; otherwise, the order submission is allowed.

[0081] If the same order submitted by the same user fails after 3 minutes, that same user can be prohibited from placing the same order again for the next 10 minutes (i.e., 10 minutes after the timestamp of the failed transaction 3 minutes later). Similarly, a Redis list structure can be used to record these restricted users.

[0082] If the same order submitted by the same user fails after 10 minutes, that same user can be prohibited from placing the same order again for the next 30 minutes (i.e., 30 minutes after the timestamp of the failed transaction 10 minutes later). Similarly, a Redis list structure can be used to record these restricted users.

[0083] This method effectively limits the frequency of user orders, preventing duplicate orders caused by external system anomalies, thereby improving resource utilization and order processing efficiency. Furthermore, it allows for further optimization and adjustments based on actual needs.

[0084] Optionally, the above order processing method may further include the following operations: in response to the value of the target point in the first bitmap structure and the second bitmap structure indicating that there is no transaction failure record in the target order message, the target order message can be traded with the transaction system through the routing system; and the value of the target point in the bitmap structure is adjusted according to the transaction result of the target order message.

[0085] Optionally, the process of adjusting the value of the target point in the bitmap structure according to the transaction result of the target order message may include the following operation: in response to the transaction result indicating that the transaction parameter verification of the target order message has failed, the value of the target point associated with the target order message is adjusted to a first preset value in the first bitmap structure.

[0086] Optionally, if the value of the target point in the first bit graph structure and the second bit graph structure indicates that there is no transaction failure record in the target order message, the target order message can be traded through the routing system and the transaction system. If the third-party routing system fails to verify the transaction parameters, the order processing system can simultaneously adjust the value of the target point associated with the three hash values ​​of the target order to a first preset value (e.g., 1) in the user's own first bit graph structure associated with the target order message.

[0087] For example, a specific string (using the user's unique identifier) ​​can be used as the key, the calculated hash value can be used as the value, and the value can be assigned to 1. Alternatively, the values ​​of points numbered 2, 3, and 5 can be set to 1 respectively.

[0088] To achieve this, you can use Redis's SETBIT command. This command is used to set the value of a specified point. For example, SETBIT paramError:User Unique Identifier:Current Date 2 1. These commands will set the values ​​of points numbered 2, 3, and 5 in the first element of the graph structure with the key "paramError:User Unique Identifier:Current Date" to 1, respectively. This ensures that the required points are correctly marked.

[0089] Optionally, the process of adjusting the value of the target point in the bitmap structure according to the transaction result of the target order message may also include the following operations: in response to the transaction result indicating an anomaly in the transaction system, adjusting the value of the target point associated with the target order message to a first preset value in the second bitmap structure; and using a hash structure to store the user identifier in the target order message and the order timestamp of the target order message.

[0090] Optionally, if the value of the target bit in the first bitmap structure and the second bitmap structure indicates that there is no transaction failure record in the target order message, the target order message can be traded through the routing system and the transaction system. If the third-party routing system returns a transaction system exception, the order processing system can simultaneously adjust the value of the target bit associated with the three hash values ​​of the target order to a first preset value (e.g., 1) in the user's own second bitmap structure.

[0091] Optionally, the hash structure used for storage can refer to the description above, that is, the user's unique identifier can be used as the key of the hash structure, and the order timestamp of the order message can be used as the field of the hash structure. When a user's pending order transaction fails, it can be recorded in the corresponding hash structure. The order timestamp of the pending order is used as the value of the field and stored as 1. This makes it easy to count the number of failed orders for each user.

[0092] Optionally, by setting two types of bitmap structures—a first bitmap structure and a second bitmap structure—it's possible to clearly distinguish between transaction parameter validation errors and transaction system errors. For both, the corresponding hash values ​​are stored in Redis, and the storage duration can be limited to 24 hours. This ensures that even with consecutive order failures, the order processing system can accurately identify and process previously failed orders without consuming excessive memory. For transaction parameter validation errors, there's no need to resubmit the order, as the transaction result may still fail. For transaction system errors, if the number of requests within one minute does not exceed three, a resubmission of the order can be attempted. This limitation prevents situations where orders are submitted before the downstream system recovers or where the order processing system continues to block orders even after the downstream system has recovered.

[0093] Optionally, the order processing method provided in this embodiment may further perform the following operations after intercepting an order: generating an interception message in response to intercepting the order message to be processed; and sending the interception message to the order submission system.

[0094] Optionally, in response to the interception operation of the order message to be processed, an interception message can be generated. The interception message may include the order number of the order to be processed, the interception time, and the reason for the interception. The interception message is sent to the order submission system to remind the relevant parties who submitted the order to be processed to process the order in a timely manner and improve the efficiency of order processing.

[0095] Figure 4A A schematic diagram illustrating an order processing method according to an embodiment of the present disclosure is shown.

[0096] like Figure 4A As shown, the order processing method framework of this embodiment adds a process for judging and intercepting orders. Specifically, the order submission system 401 can submit an order message to be processed to the order processing system 402. The order processing system 402 can remove the order number and order submission time and generate a hash value. Based on the hash value, it can determine whether there is a record of failed order transactions. If there is no record of failed order transactions, it can submit a target order message to the downstream system (including a third-party routing system and a transaction system), and the downstream system can process the target order message to obtain the order placement result. In response to a successful order placement result, the order processing system 402 records the order placement result and feeds back the order placement result to the order submission system 401. In response to a failed order placement result, the order processing system 402 temporarily stores (e.g., stores for 24 hours) the failed order placement result based on the hash value and feeds back to the order submission system 401. If the order processing system 402 determines based on the hash value that there is a record of failed order transactions, it can intercept the order and feed back to the order submission system 401.

[0097] Figure 4B Schematic illustration Figure 4A The framework diagram for determining whether there are failed order transaction records.

[0098] like Figure 4BAs shown, in one embodiment, the order processing system 402 can determine whether there is a record of failed order transactions in the following way: The order processing system 402 can first determine whether the transaction parameter verification failed based on the hash value and the first bitmap structure. If the transaction parameter verification failed, the order is directly intercepted and the process ends. If the transaction parameter verification did not fail, the system can verify whether the transaction system failed due to an anomaly based on the hash value and the second bitmap structure. If the transaction system failed due to an anomaly, the order is directly intercepted and the process ends. If the transaction system failed due to an anomaly, the system can further determine whether the failure occurred more than three times within one minute. If the failure occurred more than three times within one minute, the order is directly intercepted and the process ends. If the failure occurred less than three times within one minute, the target order message can be submitted to the downstream system again to place the order. The matching process of the hash value with the first bitmap structure and the second bitmap structure can be referred to the description above and will not be repeated here.

[0099] Figure 5 A flowchart illustrating an order processing method according to another embodiment of the present disclosure is shown.

[0100] like Figure 5 As shown, another embodiment of the order processing method disclosed herein may include operations S501 to S508.

[0101] When operating S501, when a user places an order by submitting a pending order message through the order submission system, the order information is sent to the order processing system.

[0102] When operating S502, after receiving the pending order message submitted by the user through the order submission system, the order processing system filters out the order number and the order submission time.

[0103] In operation S503, the order processing system generates three hash values ​​for the order, such as three hash codes, and uses these codes to look up the order in Redis's distributed cache.

[0104] In operation S504, check if all three hash codes exist simultaneously in the first graph structure of transactions that failed due to transaction parameter verification within the past 24 hours. If they do, directly intercept the order and return an order failure message to the order submission system, ending the process.

[0105] In operation S505, if the check structure in operation S504 does not exist, check whether the second bitmap structure of the user's transaction system failures within the past 24 hours contains all three hash codes. If they exist, determine whether the limit of 3 times per minute has been exceeded. If so, directly intercept the order and return an order failure message to the order submission system, and the process ends.

[0106] When operating S506, if none of the above conditions are met, the order processing system can submit the target order message or the pending order message to the transaction system through the third-party routing system to place the order.

[0107] When operating S507, if the transaction parameter verification of the third-party routing system fails, the order processing system will store the user's three hash codes in the first graph structure where the user's own transaction parameter verification failed. That is, the values ​​of the target points associated with the three hash values ​​of the target order will be adjusted to the first preset value.

[0108] During S508 operation, if the third-party routing system returns a transaction system error, the order processing system will store the user's three hash codes in the second bitmap structure of the user's own transaction system failure. That is, the target point value associated with the three hash values ​​of the target order will be adjusted to the first preset value.

[0109] According to embodiments of this disclosure, this method can prevent users from placing duplicate orders, reduce the pressure on CPU, network I / O, database I / O, and storage resources of the order processing system and third-party routing system, and reduce invalid interactions with the transaction system. Furthermore, it can process large amounts of order data more efficiently and accurately, providing users with a more stable and reliable transaction environment and improving user experience.

[0110] It should be noted that, unless it is explicitly stated that there is a sequential order of execution between different operations, or that there is a sequential order of execution between different operations in terms of technical implementation, the execution order between multiple operations may not be significant, and multiple operations may be executed simultaneously.

[0111] Figure 6 A block diagram of an order processing apparatus according to an embodiment of the present disclosure is shown schematically.

[0112] like Figure 6 As shown, the order processing device 600 may include a filtering module 610, a processing module 620, a positioning module 630, and an interception module 640.

[0113] The filtering module 610 is used to filter the target order parameters in the order message to be processed to obtain the target order message.

[0114] The processing module 620 is used to perform n hash processing on the target order message to obtain n hash values, where n is a positive integer.

[0115] The positioning module 630 is used to locate n target points from multiple points in a bitmap structure based on n hash values. The bitmap structure stores transaction failure records of order messages through the values ​​of the points.

[0116] The interception module 640 is used to intercept pending order messages associated with the target order message in response to the value of the target point indicating that there is a transaction failure record in the target order message.

[0117] According to embodiments of this disclosure, a target order message is obtained by filtering the target order parameters in the order message to be processed; the target order is hashed n times to obtain n hash values; based on the n hash values, n target positions are located from multiple positions in the bitmap structure; in response to the value of the target position indicating that the target order message has a transaction failure record, the order message to be processed associated with the target order message is intercepted. Since the target order message is hashed during order processing, and the existence of a transaction failure record in the target order message is obtained from the bitmap structure based on the hash value, if such a record exists, the order message to be processed is intercepted. This at least partially overcomes the high resource storage pressure caused by constantly re-placing orders. Furthermore, storing order transaction information through a bitmap structure can reduce the memory usage of transaction orders; determining the target positions through n hash values ​​can avoid the problem of difficulty in accurately determining the target positions due to insufficient or excessive positions, thereby improving the accuracy of determining the target positions. Overall, the order processing method, apparatus, equipment, storage medium, and program products provided in the embodiments of this disclosure can achieve the technical effects of improving resource utilization and order processing efficiency.

[0118] According to embodiments of this disclosure, the interception module may include a first interception unit and a second interception unit.

[0119] The first interception unit is used to intercept pending order messages associated with the target order message in response to the value of the target point in the first bit graph structure, which indicates that there is a transaction failure record in the target order message.

[0120] The second interception unit is used to respond to the value of the target point in the second bitmap structure, indicating that there is a transaction failure record in the target order message, and to intercept the pending order messages associated with the target order message according to the number of transaction failure records.

[0121] According to embodiments of this disclosure, the second interception unit may include an acquisition subunit, a generation subunit, and an interception subunit.

[0122] The acquisition sub-unit is used to acquire the order timestamp associated with the target order message within the first time period, wherein the end time of the first time period includes the submission time when the order submission system submits the pending order message.

[0123] The generation sub-unit is used to generate the number of transaction failures in the target order message based on the number of order timestamps.

[0124] The interception subunit is used to intercept pending order messages associated with the target order message in response to a transaction failure count exceeding a preset threshold.

[0125] According to embodiments of this disclosure, the order processing apparatus may further include a storage module and a limiting module.

[0126] The storage module is used to store the feature information in the target order message into a list structure in response to the number of failed transactions exceeding a preset threshold.

[0127] The restriction module is used to restrict the order submission system from submitting order messages with the same characteristics as the target order message during the second time period. The start time of the second time period includes the order message submission time associated with the case where the number of transaction failures reaches a preset threshold.

[0128] According to embodiments of this disclosure, the order processing apparatus may further include a transaction module and an adjustment module.

[0129] The transaction module is used to respond to the target order message in response to the value of the target point indicating that there is no transaction failure record, and to trade the target order message with the transaction system through the routing system.

[0130] The adjustment module is used to adjust the value of the target point in the bitmap structure based on the transaction result of the target order message.

[0131] According to embodiments of this disclosure, the adjustment module may include a first adjustment unit.

[0132] The first adjustment unit is used to adjust the value of the target point associated with the target order message to a first preset value in the first graph structure in response to the failure of transaction parameter verification of the target order message in the transaction result characterization target order message.

[0133] According to embodiments of this disclosure, the adjustment module may further include a second adjustment unit and a storage unit.

[0134] The second adjustment unit is used to respond to an anomaly in the transaction system characterized by the transaction result, and adjusts the value of the target point associated with the target order message to a first preset value in the second bitmap structure.

[0135] The storage unit is used to store the user identifier and the order timestamp of the target order message using a hash structure.

[0136] According to embodiments of this disclosure, the positioning module may include an acquisition unit, a calculation unit, and a positioning unit.

[0137] The acquisition unit is used to acquire the total number of points contained in the bitmap structure.

[0138] The operation unit is used to perform modulo operations on the n hash values ​​and the total number of points respectively to obtain n modulo results.

[0139] The positioning unit is used to locate the target point in the bitmap structure based on the points corresponding to the n modulo results.

[0140] According to embodiments of this disclosure, the filtering module may include an identified filtering unit.

[0141] The identification unit is used to identify the order message to be processed and obtain the target order parameters, which include the order identifier and the order submission time.

[0142] The filtering unit is used to filter out the order identifier and order submission time from the order message to be processed, so as to obtain the target order message.

[0143] According to embodiments of this disclosure, the order processing apparatus may further include a generation module and a sending module.

[0144] The generation module is used to intercept order messages and generate interception messages.

[0145] The sending module is used to send intercepted messages to the order submission system.

[0146] Any one or more of the modules, submodules, units, and subunits according to embodiments of the present disclosure, or at least part of the functions of any one or more of them, can be implemented in one module. Any one or more of the modules, submodules, units, and subunits according to embodiments of the present disclosure can be implemented by dividing them into multiple modules. Any one or more of the modules, submodules, units, and subunits according to embodiments of the present disclosure can be at least partially implemented as hardware circuitry, 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-Package, an Application-Specific Integrated Circuit (ASIC), or implemented in hardware or firmware by any other reasonable means of integrating or packaging circuitry, or implemented in software, hardware, or firmware, or in any suitable combination of any of these three implementation methods. Alternatively, one or more of the modules, submodules, units, and subunits according to embodiments of the present disclosure can be at least partially implemented as computer program modules, which, when run, can perform corresponding functions.

[0147] For example, any plurality of the filtering module 610, processing module 620, positioning module 630, and interception module 640 may be combined into a single module / unit / subunit, or any one of these modules / units / subunits may be split into multiple modules / units / subunits. Alternatively, at least a portion of the functionality of one or more of these modules / units / subunits may be combined with at least a portion of the functionality of other modules / units / subunits and implemented in a single module / unit / subunit. According to embodiments of this disclosure, at least one of the filtering module 610, processing module 620, positioning module 630, and interception module 640 may be at least partially implemented as hardware circuitry, 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-package, an application-specific integrated circuit (ASIC), or any other reasonable means of integrating or packaging the circuitry, or implemented in software, hardware, or firmware, or in any suitable combination of any of these three implementation methods. Alternatively, at least one of the filtering module 610, processing module 620, positioning module 630, and interception module 640 may be implemented at least partially as a computer program module that can perform corresponding functions when the computer program module is run.

[0148] It should be noted that the order processing device part in the embodiments of this disclosure corresponds to the order processing method part in the embodiments of this disclosure. For a detailed description of the order processing device part, please refer to the order processing method part, which will not be repeated here.

[0149] Figure 7 A block diagram of an electronic device suitable for implementing the order processing method described above, according to an embodiment of the present disclosure, is shown schematically. Figure 7 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments disclosed herein.

[0150] like Figure 7 As shown, an electronic device 700 according to an embodiment of the present disclosure includes a processor 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage portion 708 into a random access memory (RAM) 703. The processor 701 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or an associated chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 701 may also include onboard memory for caching purposes. The processor 701 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.

[0151] RAM 703 stores various programs and data required for the operation of electronic device 700. Processor 701, ROM 702, and RAM 703 are interconnected via bus 704. Processor 701 performs various operations of the method flow according to embodiments of the present disclosure by executing programs in ROM 702 and / or RAM 703. It should be noted that the programs may also be stored in one or more memories other than ROM 702 and RAM 703. Processor 701 may also perform various operations of the method flow according to embodiments of the present disclosure by executing programs stored in said one or more memories.

[0152] According to embodiments of this disclosure, the electronic device 700 may further include an input / output (I / O) interface 705, which is also connected to a bus 704. The electronic device 700 may also include one or more of the following components connected to the input / output (I / O) interface 705: an input section 706 including a keyboard, mouse, etc.; an output section 707 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the input / output (I / O) interface 705 as needed. A removable medium 711, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 710 as needed so that computer programs read from it can be installed into the storage section 708 as needed.

[0153] According to embodiments of this disclosure, the method flow according to embodiments of this disclosure can be implemented as a computer software program. For example, embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable storage medium, the computer program containing program code for performing the methods shown in the flowchart. In such embodiments, the computer program can be downloaded and installed from a network via communication section 709, and / or installed from removable medium 711. When the computer program is executed by processor 701, it performs the functions defined in the system of embodiments of this disclosure. According to embodiments of this disclosure, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0154] This disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs that, when executed, implement the method according to the embodiments of this disclosure.

[0155] According to embodiments of this disclosure, the computer-readable storage medium can be a non-volatile computer-readable storage medium. Examples include, but are not limited to: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this disclosure, the computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0156] For example, according to embodiments of this disclosure, a computer-readable storage medium may include the ROM 702 and / or RAM 703 described above and / or one or more memories other than ROM 702 and RAM 703.

[0157] Embodiments of this disclosure also include a computer program product comprising a computer program containing program code for performing the methods provided in the embodiments of this disclosure. When the computer program product is run on an electronic device, the program code is used to enable the electronic device to implement the order processing methods provided in the embodiments of this disclosure.

[0158] When the computer program is executed by the processor 701, it performs the functions defined in the system / apparatus of this disclosure embodiments. According to embodiments of this disclosure, the systems, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0159] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and may be downloaded and installed via the communication section 709, and / or installed from a removable medium 711. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.

[0160] According to embodiments of this disclosure, program code for executing the computer programs provided in embodiments of this disclosure can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, languages ​​such as Java, C++, Python, "C", or similar programming languages. The program code can execute entirely on a user's computing device, partially on a user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0161] The flowcharts and block diagrams in the accompanying drawings 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 a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions. Those skilled in the art will understand that the features described in the various embodiments of the present disclosure can be combined and / or combined in various ways, even if such combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments of this disclosure may be combined and / or combined in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or combinations fall within the scope of this disclosure.

[0162] The embodiments of this disclosure have been described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of this disclosure. Although various embodiments have been described above, this does not mean that the measures in the various embodiments cannot be used advantageously in combination. Various substitutions and modifications can be made by those skilled in the art without departing from the scope of this disclosure, and all such substitutions and modifications should fall within the scope of this disclosure.

Claims

1. An order processing method, characterized in that, The method includes: Filter the target order parameters in the order message to be processed to obtain the target order message; The target order message is hashed n times to obtain n hash values, where n is a positive integer; Based on the n hash values, n target points are located from multiple points in the bitmap structure, wherein the bitmap structure stores transaction failure records of order messages through the values ​​of the points; In response to the value of the target point indicating that the target order message has a transaction failure record, the pending order message associated with the target order message is intercepted.

2. The method according to claim 1, characterized in that, The bitmap structure includes a first bitmap structure and a second bitmap structure. The first bitmap structure is used to store transaction records associated with whether the transaction parameter verification failed when the target order message is traded. The second bitmap structure is used to store transaction records associated with whether an anomaly occurred in the transaction system that traded the target order message. The value responding to the target point indicates that the target order message has a transaction failure record. Intercepting the pending order messages associated with the target order message includes: In response to the value of the target point in the first bitmap structure, indicating that the target order message has a transaction failure record, the pending order message associated with the target order message is intercepted; In response to the value of the target point in the second bitmap structure, indicating that the target order message has a transaction failure record, the pending order message associated with the target order message is intercepted based on the number of transaction failure records.

3. The method according to claim 2, characterized in that, The step of intercepting the pending order messages associated with the target order message based on the number of transaction failure records includes: Obtain the order timestamp associated with the target order message within the first time period, wherein the end time of the first time period includes the submission time when the order submission system submits the order message to be processed; Based on the number of order timestamps, generate the number of transaction failures for the target order message; In response to the number of failed transactions exceeding a preset threshold, the pending order messages associated with the target order message are intercepted.

4. The method according to claim 3, characterized in that, The method further includes: In response to the number of failed transactions exceeding the preset threshold, the feature information in the target order message is stored in a list structure; During the second time period, the order submission system is restricted from submitting order messages that have the same characteristic information as the target order message. The start time of the second time period includes the order message submission time associated with the case where the number of transaction failures reaches the preset threshold.

5. The method according to claim 2, characterized in that, The method further includes: The value of the target point indicates that there is no transaction failure record in the target order message, and the target order message is traded with the transaction system through the routing system. Adjust the value of the target point in the bitmap structure according to the transaction result of the target order message.

6. The method according to claim 5, characterized in that, The step of adjusting the value of the target point in the bitmap structure based on the transaction result of the target order message includes: In response to the transaction result indicating that the transaction parameter verification of the target order message has failed, the value of the target point associated with the target order message is adjusted to a first preset value in the first graph structure.

7. The method according to claim 6, characterized in that, The step of adjusting the value of the target point in the bitmap structure based on the transaction result of the target order message further includes: In response to the transaction result indicating an anomaly in the transaction system, in the second bitmap structure, the value of the target point associated with the target order message is adjusted to the first preset value; and The user identifier and the order timestamp in the target order message are stored using a hash structure.

8. The method according to claim 1, characterized in that, The step of locating n target points from multiple points in the bitmap structure based on the n hash values ​​includes: Obtain the total number of points contained in the bitmap structure; Perform a modulo operation between each of the n hash values ​​and the total number of the points to obtain n modulo results; In the bitmap structure, the target point is located based on the points corresponding to the n modulo results.

9. The method according to claim 1, characterized in that, The process of filtering the target order parameters in the order message to obtain the target order message includes: The pending order message is identified to obtain the target order parameters, wherein the target order parameters include the order identifier and the order submission time; The target order message is obtained by filtering out the order identifier and the order submission time from the pending order message.

10. The method according to claim 1, characterized in that, The method further includes: In response to intercepting the pending order message, an interception message is generated; The intercept message is sent to the order submission system.

11. An order processing device, characterized in that, The device includes: The filtering module is used to filter the target order parameters in the order message to be processed, so as to obtain the target order message; The processing module is used to perform n hash processing on the target order message to obtain n hash values, where n is a positive integer; The positioning module is used to locate n target points from multiple points in a bitmap structure based on the n hash values, wherein the bitmap structure stores transaction failure records of order messages through the values ​​of the points; The interception module is used to intercept the pending order message associated with the target order message in response to the value of the target point indicating that the target order message has a transaction failure record.

12. An electronic device, comprising: One or more processors; Memory, used to store one or more programs. The feature is that, when the one or more programs are executed by the one or more processors, the one or more processors implement the method of any one of claims 1 to 10.

13. A computer-readable storage medium having executable instructions stored thereon, characterized in that, When executed by the processor, this instruction causes the processor to implement the method of any one of claims 1 to 10.

14. A computer program product, comprising a computer program, characterized in that, The computer program, when executed by a processor, implements the method according to any one of claims 1 to 10.

Images