CN115131097A - Order anti-duplication method and device - Google Patents
Order anti-duplication method and device Download PDFInfo
- Publication number
- CN115131097A CN115131097A CN202210751592.5A CN202210751592A CN115131097A CN 115131097 A CN115131097 A CN 115131097A CN 202210751592 A CN202210751592 A CN 202210751592A CN 115131097 A CN115131097 A CN 115131097A
- Authority
- CN
- China
- Prior art keywords
- order
- identification code
- locking
- repeated
- database
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the disclosure discloses an order anti-duplication method and a device, wherein the method comprises the following steps: assembling an identification code after receiving an order submission request to uniquely identify the order; judging whether the current order is repeated or not based on a locking mechanism and an identification code which are set in a cache; if the order is not repeated, after the business processing indicated by the order submitting request is finished, storing the order into a database, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code. By the double anti-duplication method of the cache and the database, the cost of order anti-duplication is reduced, and the anti-duplication accuracy is improved. The problems of high cost of front-end and back-end transformation and low anti-weight accuracy in the related technology are solved.
Description
Technical Field
The disclosure relates to the technical field of data processing, in particular to an order anti-duplication method and device.
Background
In internet application, when a form is submitted to a server through various application media between a client and the server, a user usually clicks a button for submitting data to trigger data submission operation on the client; due to the influences of connection points, network delay and the like, a user may have misoperation, and repeated order information may occur if the user continuously clicks the submission operation for multiple times.
In the related art, the method for preventing the order from being repeatedly submitted usually has front-end and back-end interactive processing logic, so that the front-end and back-end transformation cost is high, and the anti-duplication effect is still poor.
Disclosure of Invention
The main purpose of the present disclosure is to provide an order anti-duplication method and apparatus.
In order to achieve the above object, according to a first aspect of the present disclosure, there is provided an order anti-duplication method including: assembling an identification code after receiving an order submission request to uniquely identify the order; judging whether the current order is repeated or not based on a locking mechanism and an identification code which are set in a cache; if the order is not repeated, after the business processing indicated by the order submitting request is finished, storing the order into a database, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
Optionally, the determining whether the current order has a repetition or not based on the lock mechanism and the identification code set in the cache includes:
judging whether the order is locked currently or not based on the identification code corresponding to the submitted order;
if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value;
if the order is locked, the current order has duplication.
Optionally, before the order is deposited into a database, the method further comprises: and releasing the order lock after the locking processing after the business processing of the order is finished.
Optionally, a locking duration is further set in the locking mechanism, and when the locking duration of the order reaches a target value, the order lock after the locking processing is released.
Optionally, based on the identification code, determining whether the order is repeated by using the unique indexing mechanism.
Optionally, the determining, based on the identification code, whether the order is repeated by using the unique indexing mechanism includes: indexing the identification code, and searching whether a field identical to the index exists in a database; if the order does not exist, the order is stored so as to continuously realize the business processing related to the order; and if so, judging the order as a repeated order.
According to a second aspect of the present disclosure, there is provided an order anti-duplication apparatus including: an identification code determination unit configured to assemble an identification code upon receiving an order submission request to uniquely identify the order; the first anti-duplication unit judges whether the current order is duplicated or not based on a locking mechanism and an identification code which are set in the cache; the second anti-duplication unit stores the order into a database after the business processing indicated by the order submission request is finished if the order is not duplicated, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
Optionally, the determining whether the current order has a repetition or not based on the lock mechanism and the identification code set in the cache includes: judging whether the order is locked currently or not based on the identification code corresponding to the submitted order; if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value; if the order is locked, the current order has duplication.
According to a third aspect of the present disclosure, there is provided a computer-readable storage medium storing computer instructions for causing a computer to execute the order anti-duplication method according to any one of the implementations of the first aspect.
According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: the method comprises the following steps: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the order anti-replay method of any one of the implementations of the first aspect.
The order form anti-duplication method and the device in the embodiment of the disclosure comprise the following steps: assembling an identification code after receiving an order submitting request to uniquely identify the order; judging whether the current order is repeated or not based on a locking mechanism and an identification code which are set in a cache; if the order is not repeated, after the business processing indicated by the order submitting request is finished, the order is stored in a database, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code. By the double anti-duplication method of the cache and the database, the cost of order anti-duplication is reduced, and the anti-duplication accuracy is improved. The problems of high cost of front-end and back-end transformation and low anti-weight accuracy in the related technology are solved.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flow chart of an order anti-replay method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of an application of an order anti-replay method according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of another application of the order anti-duplication method according to the embodiment of the disclosure
Fig. 4 is a schematic diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those skilled in the art, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only some embodiments of the present disclosure, not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the present disclosure may be described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In the related art, in the method for preventing repeated submission of an order, the method is generally implemented as follows:
1. generating a request unique key for each request, generating and providing the request unique key for the front end by the back end, and caching and storing data;
2. receiving a submission request of information sent by a client through a front end, giving a unique identification code to the front end, submitting the request to a back end through the front end, and carrying a unique key;
3. and the server analyzes the data, and performs cache deletion on each unique key, wherein successful deletion represents a first request, the processing is continued, and unsuccessful deletion represents repeated submission. (allowing only one request)
In the mode, usually, a token interface is generated independently at the rear end, a token and the like are acquired at the front end when the token interface is called each time, the front end and the rear end need to be modified, and the work input cost is high.
It should be noted that, in the present disclosure, the embodiments and the features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
According to an embodiment of the present disclosure, an order anti-duplication method is provided, as shown in fig. 1, the method includes the following steps 101 to 104:
step 101: an identification code is assembled upon receipt of an order submission request to uniquely identify the order.
In this embodiment, the server may receive the order submission request, identify the service data of the order, and obtain an identification code corresponding to the order, and in order to ensure the uniqueness of the order identification, design may be performed by combining the service data in the order, for example: the platform number + order number of the order obtains the identification code, which is only exemplary, and the global uniqueness of the service field is satisfied, and the specific algorithm is not limited.
Step 102: and judging whether the current order is repeated or not based on a lock mechanism and an identification code which are set in the cache.
In this embodiment, the cache may be implemented by adopting a distributed cache, redis, memcached, or the like. Taking redis cache as an example, by using a redis technology and utilizing the timeliness of a locking mechanism, the problem of submitting various repeated data caused by multiple clicks in a short time is solved, and meanwhile, due to the introduction of the locking mechanism, the problem of repeated submission of a form in any time period can be judged whether the order is repeated or not; and in the above judgment process, the judgment is realized based on the identification code. Further, if the duplication does not exist, the data is stored in a cache, and if the duplication exists, error reporting information submitted repeatedly is returned.
Step 103: and if the order is not repeated, storing the order into a database after the service processing indicated by the order submitting request is finished, wherein an index mechanism is preset in the database.
In this embodiment, if it is determined that there is no duplication in the cache, the data may be stored in the cache and the order data may be stored in the database. In the link of judging whether the orders are repeated or not by caching, the unidentified repeated orders can exist, so that the second judgment is carried out in the link of the database.
Step 104: and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
In this embodiment, the index may be performed based on the identification code, and it may be determined whether there is a duplicate order in the database, and if not, the order data may be stored for subsequent service processing.
Referring to fig. 2, fig. 2 is a flow chart illustrating a method according to the embodiment, and order submission request information is received; reading the unique identification code of the order information from the cache; judging whether the order is repeatedly submitted; if the order is a repeat submission, rejecting the submission request; if the order is not repeatedly submitted, processing the order; writing the order submitting request information into a storage; if the store triggers the unique constraint, then the commit request is denied; and if the storage is normal, normal processing is carried out, and the service is ended.
The method is realized by a server side, the problem of repeated submission of order data is realized by the steps of assembling a unique identification code, caching and storing data, storing the data in a database and the like according to the global unique characteristic of a business incoming order number, and the aim of preventing the repeated submission is fulfilled by multiple protections of distributed caching, the database and the like.
As an optional implementation manner of this embodiment, the determining whether the current order has the repetition or not based on the lock mechanism and the identification code set in the cache includes: judging whether the order is locked currently or not based on the identification code corresponding to the submitted order; if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value; if the order is locked, the current order has duplication.
In this optional implementation manner, when the order to be submitted is faced, it may be determined whether the order is in a locked state, and if the order is not in the locked state, the current order may be locked, and the locking value may be determined based on the unique identifier of the order.
Taking redis as an example, the order submission request information may be written into redis using set [ set, value, "NX", "PX", expTime ], and if the writing operation succeeds, the order is executed normally, and if the writing operation fails, the order is determined to be a duplicate order. The process of judging the order repetition through the locking mechanism in the cache can comprise the following steps: and locking the order and setting a value, and if the locking is not successful, indicating that the order belongs to the repeated order. And when the locking is successful, performing service processing aiming at different orders, and releasing the lock after the processing is finished.
As an optional implementation manner of this embodiment, before the order is stored in the database, the method further includes: and releasing the order lock after the locking processing after the business processing of the order is finished.
In this optional implementation manner, after the service of the current order is processed and before the unlocking is performed, whether the order is the currently processed order may be determined based on the locking value of the currently processed order, so as to prevent an unlocking error.
As an optional implementation manner of this embodiment, a locking duration is further set in the lock mechanism, and when the locking duration of the order reaches a target value, the order lock after the locking processing is released.
In this optional implementation manner, a timing task may be further set, and when the locking duration reaches the set target duration, the lock may be released. And directly feeding back error reporting information of repeated submission when repeated orders are submitted within the target time length. For example, a time for preventing duplicate requests is preset for each request, and the duplicate requests in the time range are considered to be intercepted, such as: the anti-duplication time is set to be 2 seconds, which means that repeated requests within 2 seconds can be intercepted, configuration setting can be specifically carried out according to actual needs of services, and only one request is allowed within the anti-duplication time.
Referring to fig. 3, the locking mechanism in the cache may include the steps of: locking and setting values by a mechanism program; if the locking is successful, setting a value for the new order of the order; normally carrying out service processing; if the order is the order lock; releasing the lock; if not, the order lock; and (6) ending. If the locking fails, the order judges a repeated order; and (6) ending. After the timing task is started; releasing the lock if the lock is overdue; and if the lock is not expired, ending the process.
As an optional implementation manner of this embodiment, based on the identification code, whether the order is repeated is determined by using the unique indexing mechanism.
In this alternative implementation, if the duration of the order submission interval is greater than the aforementioned target duration, there may still be a duplicate order, for example, the target duration is 2 seconds, the lock is released when 2 seconds have expired, and the second submission interval is 3 seconds, and the second submitted order will not be identified as being duplicate. Therefore, repeated order searching can be carried out in the database based on the order identification code before warehousing in the database. And (3) performing anti-replay processing (ensuring normal operation of a service) by using a unique index mechanism of the database, and when the data can be normally written in the first time, the data written in the second time can be wrongly reported because of the unique index.
According to the embodiment, the purpose of preventing the order form from being heavy is achieved through double judgment of the cache and the database. The problem of repeated submissions many times in a short time and the repeated submissions many times due to abnormal conditions (not in a short time) lead to order repetition is solved. The method of the embodiment is easy to reform, can simplify the reforming difficulty of the existing program, only needs the modification of the server side, and does not need the modification of the front end; the method has low cost, only relates to the transformation of a server, simplifies the development of the front end, and performs joint debugging on the front end and the rear end.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than here.
According to an embodiment of the present disclosure, there is also provided a device for implementing the above order anti-duplication method, the device including: an identification code determination unit configured to assemble an identification code upon receipt of an order submission request to uniquely identify the order; the first anti-duplication unit judges whether the current order is duplicated or not based on a locking mechanism and an identification code which are set in the cache; the second anti-duplication unit stores the order into a database after the business processing indicated by the order submission request is finished if the order is not duplicated, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
As an optional implementation manner of this embodiment, the determining whether the current order has the repetition or not based on the lock mechanism and the identification code set in the cache includes: judging whether the order is locked currently or not based on the identification code corresponding to the submitted order; if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value; if the order is locked, the current order has duplication.
As an optional implementation manner of this embodiment, before the order is stored in the database, the method further includes: and releasing the order lock after the locking processing after the business processing of the order is finished.
As an optional implementation manner of this embodiment, a locking duration is further set in the lock mechanism, and when the locking duration of the order reaches a target value, the order lock after the locking processing is released.
As an optional implementation manner of this embodiment, based on the identification code, whether the order is repeated is determined by using the unique indexing mechanism.
As an optional implementation manner of this embodiment, the determining, based on the identification code, whether the order is repeated by using the unique indexing mechanism includes: indexing the identification code, and searching whether a field identical to the index exists in a database; if the order does not exist, the order is stored so as to continuously realize the business processing related to the order; and if so, judging the order as a repeated order.
An embodiment of the present disclosure provides an electronic device, as shown in fig. 4, the electronic device includes one or more processors 41 and a memory 42, where one processor 41 is taken as an example in fig. 4.
The controller may further include: an input device 43 and an output device 44.
The processor 41, the memory 42, the input device 43 and the output device 44 may be connected by a bus or other means, and fig. 4 illustrates the connection by a bus as an example.
The processor 41 may be a Central Processing Unit (CPU). The processor 41 may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or combinations thereof. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 42, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the control methods in the embodiments of the present disclosure. The processor 41 executes various functional applications of the server and data processing, i.e. implements the method of the above-described method embodiments, by running non-transitory software programs, instructions and modules stored in the memory 42.
The memory 42 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of a processing device operated by the server, and the like. Further, the memory 42 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 42 may optionally include memory located remotely from processor 41, which may be connected to a network connectivity device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input means 43 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the processing means of the server. The output device 44 may include a display device such as a display screen.
One or more modules are stored in the memory 42, which when executed by the one or more processors 41, perform the method as shown in fig. 1.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium, and when executed, the program can include the processes of the embodiments of the motor control methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-only memory (ROM), a Random Access Memory (RAM), a flash memory (FlashMemory), a hard disk (hard disk drive, abbreviated as HDD) or a Solid State Drive (SSD), etc.; the storage medium may also comprise a combination of memories of the kind described above.
Although the embodiments of the present disclosure have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present disclosure, and such modifications and variations fall within the scope defined by the appended claims.
Claims (10)
1. An order form repeat prevention method, comprising:
assembling an identification code after receiving an order submission request to uniquely identify the order;
judging whether the current order is repeated or not based on a locking mechanism and an identification code which are set in a cache;
if the order is not repeated, after the business processing indicated by the order submitting request is finished, storing the order into a database, wherein an index mechanism is preset in the database;
and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
2. The order form repeat-prevention method of claim 1, wherein the determining whether there is a repeat of the current order form based on the lock mechanism and the identification code set in the cache comprises:
judging whether the order is locked currently or not based on the identification code corresponding to the submitted order;
if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value;
if the order is locked, the current order has duplication.
3. The order anti-replay method of claim 2, wherein prior to storing the order in a database, the method further comprises:
and releasing the order lock after the locking processing after the business processing of the order is finished.
4. The order form anti-duplication method of claim 2, wherein a locking duration is further set in the locking mechanism, and when the locking duration of the order form reaches a target value, the order form lock after the locking process is released.
5. The order form repeat-prevention method of claim 2 wherein the unique indexing mechanism is used to determine whether the order form is repeated based on the identification code.
6. The order form repeat-prevention method of claim 5, wherein determining whether the order form is repeated using the unique indexing mechanism based on the identification code comprises:
indexing the identification code, and searching whether a field identical to the index exists in a database;
if the order does not exist, the order is stored so as to continuously realize the business processing related to the order;
and if so, judging the order as a repeated order.
7. An order anti-weight device, comprising:
an identification code determination unit configured to assemble an identification code upon receipt of an order submission request to uniquely identify the order;
the first anti-duplication unit judges whether the current order is duplicated or not based on a locking mechanism and an identification code which are set in the cache;
the second anti-duplication unit stores the order into a database after the business processing indicated by the order submission request is finished if the order is not duplicated, wherein an index mechanism is preset in the database; and judging whether the order is repeated or not by utilizing the index mechanism based on the identification code.
8. The order form repeat-prevention device of claim 7 wherein the determining whether there is a repeat of the current order based on the lock mechanism and the identification code set in the cache comprises:
judging whether the order is locked currently or not based on the identification code corresponding to the submitted order;
if the orders are not locked, locking the submitted orders and giving locking values, wherein the identification code corresponding to each order can be mapped with one locking value;
if the order is locked, the current order has duplication.
9. A computer-readable storage medium having stored thereon computer instructions for causing a computer to execute the order anti-replay method of any of claims 1-7.
10. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the order anti-replay method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210751592.5A CN115131097A (en) | 2022-06-28 | 2022-06-28 | Order anti-duplication method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210751592.5A CN115131097A (en) | 2022-06-28 | 2022-06-28 | Order anti-duplication method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115131097A true CN115131097A (en) | 2022-09-30 |
Family
ID=83380450
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210751592.5A Pending CN115131097A (en) | 2022-06-28 | 2022-06-28 | Order anti-duplication method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115131097A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116483868A (en) * | 2023-04-14 | 2023-07-25 | 首约科技(北京)有限公司 | Method, device, equipment, medium and program for improving capacity response efficiency |
-
2022
- 2022-06-28 CN CN202210751592.5A patent/CN115131097A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116483868A (en) * | 2023-04-14 | 2023-07-25 | 首约科技(北京)有限公司 | Method, device, equipment, medium and program for improving capacity response efficiency |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110213356B (en) | Login processing method based on data processing and related equipment | |
| CN107220142B (en) | Method and device for executing data recovery operation | |
| CN106325978B (en) | Distributed transaction processing method and device | |
| CN103782573A (en) | Masking server outages from clients and applications | |
| US9736155B2 (en) | System, method, and apparatus for authentication | |
| CN110222085B (en) | Processing method and device for certificate storage data and storage medium | |
| CN112052264B (en) | Business data query method and device, electronic equipment and readable storage medium | |
| CN112256776B (en) | Form repeated submission detection method and device, computer equipment and storage medium | |
| CN115131097A (en) | Order anti-duplication method and device | |
| CN112463318A (en) | Timed task processing method, device and system | |
| CN112150146A (en) | Block processing method, device and equipment of block chain and storage medium | |
| CN111127088A (en) | Method, device, computer equipment and storage medium for realizing final consistency | |
| CN116302623A (en) | Idempotent control method, device, equipment and storage medium based on interaction request | |
| CN109246077B (en) | Distributed concurrent transaction verification method, device and computer storage medium | |
| CN110597886A (en) | Data processing method and device and computer storage medium | |
| CN115271694A (en) | Order payment method and system | |
| CN111488252B (en) | Flow playback method and device | |
| CN110968632B (en) | Method and system for unified data exchange | |
| CN111179524B (en) | ATM (automatic Teller machine) card retaining and retrieving method and device | |
| CN111367694A (en) | Event processing method, server and computer storage medium | |
| CN112035495B (en) | Data synchronization method, device, server and storage medium | |
| CN116594598B (en) | Information interaction method and device of service system | |
| CN113379542B (en) | Block chain transaction query method, device, medium and electronic equipment | |
| CN106330945B (en) | Digital certificate synchronization method, digital signature server and digital certificate synchronization system | |
| CN115344298A (en) | Operation execution method and device |
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 |