CN109213815B - Method, device, server terminal and readable medium for controlling execution times - Google Patents

Abstract

The invention discloses a method and a device for controlling execution times, a server terminal and a readable medium, and relates to the technical field of computers. One embodiment of the method comprises: receiving an execution operation request of a client; reading corresponding execution operation data from the memory database according to the execution operation request; and judging whether the execution times exceed a preset threshold value according to the execution operation data, and then returning a response of whether the execution operation is allowed or not according to a judgment result. The implementation method can ensure the performance, meanwhile, can also persist the required data, makes up the deficiency of the disk database, can control various execution events, and has wide range and higher flexibility.

Description

Method, device, server terminal and readable medium for controlling execution times

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for controlling execution times, a server terminal, and a readable medium.

Background

With the development of computer technology, in many practical operation scenarios, there is often a need for controlling the number of times of executing some operations, for example, there is malicious repeated submission operation, or in some businesses, it is specified that the number of times of executing operations in a certain time cannot exceed a value, and the like.

The prior art schemes for controlling the number of times of execution of operations are basically as follows: the first is to make the data related to the operation persist in the traditional database, then read out the data according to the need, in order to judge whether to return the result that can be carried out, for example can make the operation number persist in MySQL database and read, achieve the goal of controlling the operation number; the second method controls the corresponding operations in the page, for example, a timer and a counter are started by using JavaScript script to control the operation times, but this control can only be adapted to a few executed operations, and there is no flexibility.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

1. low performance

Because the traditional database is a disk database, data required to be accessed by a user is generally loaded into a main memory, and the management based on the data is a disk cache technology, a bottleneck of accessing an I/O disk exists, the reading and writing speed is low, and the performance is greatly reduced.

2. Low flexibility

Although the problem of data access does not exist by using the JavaScript script to control the operation times, the security is low, and the database persistence cannot be performed, so that only a few execution types can be controlled, the method has great limitation and low flexibility, and can only be used for controlling simpler execution operation generally.

3. High complexity

The database persistence operation is relatively complex, and is not beneficial to later maintenance and secondary development.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method, an apparatus, a server terminal and a readable medium for controlling execution times, which can persist required data while ensuring performance, make up for the deficiency of a disk database, and control various execution events, and have a wide range and high flexibility.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of controlling the number of executions.

The method for controlling the execution times of the embodiment of the invention comprises the following steps: receiving an execution operation request of a client; reading corresponding execution operation data from the memory database according to the execution operation request; and judging whether the execution times exceed a preset threshold value according to the execution operation data, and then returning a response of whether the execution operation is allowed or not according to a judgment result.

Optionally, the in-memory database includes at least one of: redis, memcached.

Optionally, the execution operation data includes one or more of the following: the unique identifier is used for uniquely identifying a KEY value corresponding to an operation, a counter value of the KEY value representing the operation times and the survival time of the KEY value.

Optionally, the determining, according to the execution operation data, whether the execution number exceeds a preset threshold, and then returning, according to the determination result, a response of whether to allow the execution operation includes: if the KEY value is empty or the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed; if the KEY value is not empty and the value of the counter of the KEY value is greater than or equal to the preset threshold, judging whether the survival time of the KEY value is greater than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

Optionally, if the KEY value is null, the KEY value is initialized first, the lifetime is assigned, then 1 is added to the counter of the corresponding KEY value, and a response allowing the execution of the operation is returned.

To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an apparatus for controlling the number of executions.

The device for controlling the execution times of the embodiment of the invention comprises: the receiving module is used for receiving an execution operation request of a client; the reading module is used for reading corresponding execution operation data from the memory database according to the execution operation request; and the judging module is used for judging whether the execution times exceeds a preset threshold value according to the execution operation data and then returning a response whether the execution operation is allowed or not according to a judgment result.

Optionally, the in-memory database includes at least one of: redis, memcached.

Optionally, the execution operation data includes one or more of the following: the unique identifier is used for uniquely identifying a KEY value corresponding to an operation, a counter value of the KEY value representing the operation times and the survival time of the KEY value.

Optionally, the determining module is further configured to: if the KEY value is empty or the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed; if the KEY value is not empty and the value of the counter of the KEY value is greater than or equal to the preset threshold, judging whether the survival time of the KEY value is greater than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

Optionally, the determining module is further configured to: if the KEY value is null, the KEY value is initialized, the survival time is assigned, 1 is added to a counter of the corresponding KEY value, and a response allowing the operation to be executed is returned.

To achieve the above object, according to still another aspect of embodiments of the present invention, a server terminal is provided.

A server terminal of an embodiment of the present invention includes: one or more processors; a storage device, configured to store one or more programs, which when executed by the one or more processors, cause the one or more processors to implement the method for controlling the number of executions of the embodiment of the present invention.

To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided a computer-readable medium.

A computer-readable medium of an embodiment of the present invention has stored thereon a computer program that, when executed by a processor, implements the method of controlling the number of executions of an embodiment of the present invention.

One embodiment of the above invention has the following advantages or benefits: because the technical means of storing the execution operation data in the memory database is adopted, the technical problem of the bottleneck of disk I/O during database access is solved, and the technical effects of improving the system performance, accelerating the data processing speed and realizing the high-efficiency and high-performance execution time control are achieved; by utilizing the execution operation data in the memory database, whether the KEY value corresponding to the operation is empty and whether the operation times exceed the threshold value are judged, so that the performance can be ensured, the required data can be persisted, the defects of the disk database are overcome, various execution events can be controlled, the range is wide, and the flexibility is high; and the flexibility of the program for controlling the execution times is improved, so that the program development and transplantation are more flexible and convenient, the later maintenance and secondary development are facilitated, and the implementation complexity is greatly reduced.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

FIG. 2 is a schematic diagram of a main flow of a method of controlling the number of executions according to an embodiment of the present invention;

FIG. 3 is a system framework diagram in which embodiments of the present invention may be applied;

FIG. 4 is a schematic diagram of a server-side framework for implementing a method of controlling execution times according to an embodiment of the present invention;

FIG. 5 is a schematic business logic flow diagram of a server for implementing an embodiment of the present invention;

fig. 6 is a logic diagram of a servicelogic judgment case 1 for implementing the service end of the embodiment of the present invention;

FIG. 7 is a logic diagram of a servicelogic determination case 2 for implementing the service end of the embodiment of the present invention;

FIG. 8 is a schematic diagram of the main blocks of an apparatus for controlling the number of executions according to an embodiment of the present invention;

fig. 9 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 illustrates anexemplary system architecture 100 to which a method of controlling the number of executions or a device for controlling the number of executions of an embodiment of the present invention may be applied.

As shown in fig. 1, thesystem architecture 100 may includeterminal devices 101, 102, 103, anetwork 104, and aserver 105. Thenetwork 104 serves as a medium for providing communication links between theterminal devices 101, 102, 103 and theserver 105.Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use theterminal devices 101, 102, 103 to interact with theserver 105 via thenetwork 104 to receive or send messages or the like. Theterminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

Theterminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

Theserver 105 may be a server providing various services, such as a background management server (for example only) providing support for shopping-like websites browsed by users using theterminal devices 101, 102, 103. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.

It should be noted that the method for controlling the execution times provided by the embodiment of the present invention is generally executed by theserver 105, and accordingly, the device for controlling the execution times is generally disposed in theserver 105.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Fig. 2 is a schematic diagram of a main flow of a method of controlling the number of executions according to an embodiment of the present invention.

As shown in fig. 2, a method for controlling execution times according to an embodiment of the present invention mainly includes the following steps:

step S201: and receiving an execution operation request of the client.

Step S202: and reading corresponding execution operation data from the memory database according to the execution operation request. Wherein the in-memory database comprises at least one of: redis, memcached. The execution operation data comprises one or more of the following: the unique identifier is used for uniquely identifying a KEY value corresponding to an operation, a counter value of the KEY value representing the operation times and the survival time of the KEY value.

Step S203: and judging whether the execution times exceed a preset threshold value according to the execution operation data, and then returning a response of whether the execution operation is allowed or not according to a judgment result. The specific judgment is as follows: if the KEY value is empty or the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed; if the KEY value is not empty and the value of the counter of the KEY value is greater than or equal to the preset threshold, judging whether the survival time of the KEY value is greater than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

In addition, if the KEY value is null, the KEY value is initialized first, the lifetime is assigned, then 1 is added to the counter of the corresponding KEY value, and a response allowing the execution of the operation is returned.

Fig. 3 is a system framework diagram in which embodiments of the present invention may be applied. As shown in fig. 3, the system framework includes a client and a server.

Wherein, the client is used for: configuring information about the calling service and providing corresponding parameter information.

The server is used for:

(1) and receiving a client request and parameters, and returning a result of whether the operation is allowed to be executed to the client.

(2) And reading execution operation data such as the number of execution operations and the survival time of the corresponding operation KEY value, judging whether the operation can be executed according to the obtained execution operation data, and adding 1 to a counter of the KEY value in the corresponding operation if the operation can be executed. In the embodiment of the invention, a certain type of execution operation request of the client can be uniquely identified by the KEY VALUE in the memory database, and the number of operation times is identified by using the VALUE field as a counter. The memory database in the embodiment of the present invention includes but is not limited to at least one of the following: redis, Memcached.

(3) High-performance read-write operation is provided, client requests are responded quickly, and data can be persisted.

Fig. 4 is a schematic diagram of a server framework for implementing the method for controlling the execution times according to the embodiment of the present invention. As shown in fig. 4, the server can be divided into a service logic layer and a data access layer. The service logic layer encapsulates the implementation of the control on the execution operation times, the data access layer provides read-write service for data in the memory database such as redis, the service logic layer calls the data access layer to obtain data related to the operation, performs service judgment, and finally returns a result of whether the execution is allowed to the client.

Fig. 5 is a schematic business logic flow diagram of a server for implementing an embodiment of the present invention. As shown in fig. 5, the logic flow of the service logic layer is specifically as follows:

1. and receiving a request of the client to obtain the parameters transmitted by the client.

2. And calling a data access layer to read the numerical value in the counter corresponding to the KEY value operation in the memory databases such as redis.

3. And judging whether the KEY value is empty and whether the obtained value of the operation execution counter is less than the maximum operation times, giving judgment according to different conditions, and returning a final result.

Fig. 6 is a logic diagram of a servicelogic judgment case 1 for implementing the service end of the embodiment of the present invention; fig. 7 is a logic diagram of a servicelogic determination case 2 for implementing the service end of the embodiment of the present invention. Two types of determination of the business logic flow are described in detail below with reference to fig. 6 and 7.

Wherein, fig. 6 corresponds to the service logic of the judgment case 1:

1. when the KEY value is empty, the operation is executed for the first time, so that the KEY value is initialized first, and the corresponding survival time of the KEY value is assigned;

2. adding 1 to the corresponding counter;

3. and returning the result of the allowed execution to the client.

The business logic in fig. 7 corresponding to decision case 2:

1. the logic business layer calls a data access layer to read the survival time of the corresponding KEY value;

2. if the survival time is more than 0, returning a result of refusing to execute the operation;

3. if the survival time is less than 0, continuously judging whether the KEY value exists;

4. if the KEY value does not exist, the survival time of the KEY is exceeded, the KEY is automatically deleted, and a result of allowing the operation to be executed is returned;

5. if the KEY value exists, indicating that no value has been assigned to the KEY's lifetime, the KEY is deleted and the result of allowing the operation to be performed is returned.

According to the technical scheme of the method for controlling the execution times, the technical means of storing the execution operation data in the memory database is adopted, so that the technical problem of the bottleneck of disk I/O during database access is solved, and the technical effects of improving the system performance, accelerating the data processing speed and realizing high-efficiency and high-performance execution time control are achieved; by utilizing the execution operation data in the memory database, whether the KEY value corresponding to the operation is empty and whether the operation times exceed the threshold value are judged, so that the performance can be ensured, the required data can be persisted, the defects of the disk database are overcome, various execution events can be controlled, the range is wide, and the flexibility is high; and the flexibility of the program for controlling the execution times is improved, so that the program development and transplantation are more flexible and convenient, the later maintenance and secondary development are facilitated, and the implementation complexity is greatly reduced.

Fig. 8 is a schematic diagram of main blocks of an apparatus for controlling the number of executions according to an embodiment of the present invention.

As shown in fig. 8, theapparatus 800 for controlling execution times according to the embodiment of the present invention mainly includes: a receivingmodule 801, areading module 802 and a judgingmodule 803.

The receivingmodule 801 is configured to receive an execution operation request of a client; areading module 802, configured to read corresponding execution operation data from the memory database according to the execution operation request; the determiningmodule 803 is configured to determine whether the execution frequency exceeds a preset threshold according to the execution operation data, and then return a response indicating whether the execution of the operation is allowed according to the determination result.

Wherein the in-memory database may include at least one of: redis, memcached. The execution operation data may include one or more of the following: the unique identifier is used for uniquely identifying a KEY value corresponding to an operation, a counter value of the KEY value representing the operation times and the survival time of the KEY value.

Furthermore, the determiningmodule 803 may be further configured to: if the KEY value is empty or the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed; if the KEY value is not empty and the value of the counter of the KEY value is greater than or equal to the preset threshold, judging whether the survival time of the KEY value is greater than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

In addition, the determiningmodule 803 may further be configured to: if the KEY value is null, the KEY value is initialized, the survival time is assigned, 1 is added to a counter of the corresponding KEY value, and a response allowing the operation to be executed is returned.

From the above description, it can be seen that the technical means of storing the execution operation data in the memory database is adopted, so that the technical problem of disk I/O bottleneck during database access is overcome, and the technical effects of improving system performance, accelerating data processing speed and realizing efficient and high-performance execution time control are achieved; by utilizing the execution operation data in the memory database, whether the KEY value corresponding to the operation is empty and whether the operation times exceed the threshold value are judged, so that the performance can be ensured, the required data can be persisted, the defects of the disk database are overcome, various execution events can be controlled, the range is wide, and the flexibility is high; and the flexibility of the program for controlling the execution times is improved, so that the program development and transplantation are more flexible and convenient, the later maintenance and secondary development are facilitated, and the implementation complexity is greatly reduced.

Referring now to FIG. 9, shown is a block diagram of acomputer system 900 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 9, thecomputer system 900 includes a Central Processing Unit (CPU)901 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from astorage section 908 into a Random Access Memory (RAM) 903. In theRAM 903, various programs and data necessary for the operation of thesystem 900 are also stored. TheCPU 901,ROM 902, andRAM 903 are connected to each other via abus 904. An input/output (I/O)interface 905 is also connected tobus 904.

The following components are connected to the I/O interface 905: aninput portion 906 including a keyboard, a mouse, and the like; anoutput section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; astorage portion 908 including a hard disk and the like; and acommunication section 909 including a network interface card such as a LAN card, a modem, or the like. Thecommunication section 909 performs communication processing via a network such as the internet. Thedrive 910 is also connected to the I/O interface 905 as necessary. Aremovable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on thedrive 910 as necessary, so that a computer program read out therefrom is mounted into thestorage section 908 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through thecommunication section 909, and/or installed from theremovable medium 911. The above-described functions defined in the system of the present invention are executed when the computer program is executed by a Central Processing Unit (CPU) 901.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises a receiving module, a reading module and a judging module. The names of these modules do not in some cases constitute a limitation to the modules themselves, and for example, a receiving module may also be described as a "module that receives a request for performing an operation by a client".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving an execution operation request of a client; reading corresponding execution operation data from the memory database according to the execution operation request; and judging whether the execution times exceed a preset threshold value according to the execution operation data, and then returning a response of whether the execution operation is allowed or not according to a judgment result.

According to the technical scheme of the embodiment of the invention, because the technical means of storing the execution operation data in the memory database is adopted, the technical problem of the bottleneck of disk I/O during database access is solved, and the technical effects of improving the system performance, accelerating the data processing speed and realizing the high-efficiency and high-performance execution time control are achieved; by utilizing the execution operation data in the memory database, whether the KEY value corresponding to the operation is empty and whether the operation times exceed the threshold value are judged, so that the performance can be ensured, the required data can be persisted, the defects of the disk database are overcome, various execution events can be controlled, the range is wide, and the flexibility is high; and the flexibility of the program for controlling the execution times is improved, so that the program development and transplantation are more flexible and convenient, the later maintenance and secondary development are facilitated, and the implementation complexity is greatly reduced.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (8)

1. A method of controlling execution times, comprising:

receiving an execution operation request of a client;

reading corresponding execution operation data from the memory database according to the execution operation request; the execution operation data comprises at least one of a KEY value for uniquely identifying a corresponding operation, a value of a counter of the KEY value representing the operation times and the survival time of the KEY value;

if the KEY value is empty, initializing the KEY value, assigning survival time, adding 1 to a counter of the corresponding KEY value, and returning a response allowing execution of operation; or

If the KEY value is not empty, judging whether the value of a counter of the KEY value exceeds a preset threshold value, and then returning a response whether to allow the operation to be executed according to the judgment result.

2. The method of claim 1, wherein the in-memory database comprises at least one of: redis, memcached.

3. The method of claim 1, wherein determining whether the value of the counter of the KEY value exceeds a preset threshold and then returning a response indicating whether the execution of the operation is allowed according to the determination result comprises:

if the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed;

if the value of the counter of the KEY value is larger than or equal to the preset threshold, judging whether the survival time of the KEY value is larger than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

4. An apparatus for controlling a number of executions, comprising:

the receiving module is used for receiving an execution operation request of a client;

the reading module is used for reading corresponding execution operation data from the memory database according to the execution operation request; the execution operation data comprises at least one of a KEY value for uniquely identifying a corresponding operation, a value of a counter of the KEY value representing the operation times and the survival time of the KEY value;

the judging module is used for initializing the KEY value and assigning survival time if the KEY value is null, then adding 1 to a counter of the corresponding KEY value and returning a response allowing the operation to be executed; or if the KEY value is not empty, judging whether the value of the counter of the KEY value exceeds a preset threshold value, and then returning a response whether to allow the operation to be executed according to the judgment result.

5. The apparatus of claim 4, wherein the in-memory database comprises at least one of: redis, memcached.

6. The apparatus of claim 4, wherein the determining module is further configured to:

if the value of the counter of the KEY value is smaller than the preset threshold value, returning a response allowing the operation to be executed;

if the value of the counter of the KEY value is larger than or equal to the preset threshold, judging whether the survival time of the KEY value is larger than 0, if so, returning a response of refusing to execute the operation, otherwise, continuously judging whether the KEY value still exists, if not, returning a response of allowing to execute the operation, if so, deleting the KEY value, and returning a response of allowing to execute the operation.

7. A server terminal, characterized by comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-3.

8. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-3.

Images