CN111338810A - Method and apparatus for storing information - Google Patents

Abstract

The embodiment of the application discloses a method and a device for storing information. One embodiment of the method comprises: receiving at least one identification information to be stored; selecting identification information to be stored from at least one identification information to be stored, and executing the following storage steps: generating a queue element comprising the identification information to be stored and the current time in response to determining that the target queue in the queue group does not comprise the selected identification information to be stored; determining whether a queue length of the target queue is less than a length threshold; in response to determining yes, storing the generated queue element to the target queue; in response to the determination of no, establishing a new queue, storing the generated queue elements to the new queue, adding the new queue to the queue group, and determining the new queue as a target queue; determining whether at least one piece of identification information to be stored has unselected identification information to be stored; in response to determining that there is no, outputting the set of queues. This embodiment enables deduplication of the queue.

Description

Method and apparatus for storing information

technical field

The embodiments of the present application relate to the field of computer technologies, in particular to the field of Internet technologies, and in particular, to methods and apparatuses for storing information.

Background technique

A message is a unit of data sent between two computers. Messages can contain text strings; they can also contain embedded objects.

A message queue is a container that holds messages during their transmission. A message queue manager acts as a middleman when relaying messages from its source to its destination. The main purpose of a queue is to provide routing and guarantee delivery of messages; if a receiver is unavailable when a message is sent, a message queue holds the message until it can be delivered successfully.

SUMMARY OF THE INVENTION

The embodiments of the present application propose a method and apparatus for storing information.

In a first aspect, an embodiment of the present application provides a method for storing information, the method includes: receiving at least one identification information to be stored; selecting identification information to be stored from the at least one identification information to be stored, and performing the following storage Step: in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a queue element including the selected identification information to be stored and the time information of the current time; determine whether the queue length of the above-mentioned target queue is less than Length threshold; in response to determining yes, store the generated queue elements in the above-mentioned target queue; in response to determining no, establish a new queue, store the generated queue elements in the above-mentioned new queue, and add the above-mentioned new queue to the above-mentioned queue group, Determining the above-mentioned new queue as a target queue; determining whether there is unselected identification information to be stored in the at least one identification information to be stored; in response to determining that it does not exist, outputting the above-mentioned queue group.

In some embodiments, the above method further includes: in response to determining that there is unselected identification information to be stored in the at least one identification information to be stored, reselecting the unselected identification information to be stored from the at least one identification information to be stored The identification information is stored, and the above storage steps are continued.

In some embodiments, after outputting the queue group in response to determining that it does not exist, the storing step further includes: deleting queue elements in the queue group other than the target queue that are the same as the queue elements in the target queue Elements.

In some embodiments, after the above-mentioned outputting the above-mentioned queue group in response to determining that it does not exist, the above-mentioned storing step further includes: sequentially acquiring a preset number of queue elements from the above-mentioned target queue, for the acquired preset number of queue elements The queue element in the queue element generates an element to be confirmed based on the preset number of retries, the identification information and time information in the queue element, adds the generated element to be confirmed to the queue to be confirmed, and removes the queue element from the above target. removed from the queue.

In some embodiments, the above-mentioned storing step further includes: for the to-be-confirmed element in the above-mentioned to-be-confirmed queue, sending the identification information in the to-be-confirmed element to the client of the communication connection, and receiving the information sent from the above-mentioned client for the above-mentioned The feedback information of the identification information, in response to determining that the identification information is not confirmed according to the above-mentioned feedback information, the number of retries in the element to be confirmed is increased by a predetermined value, in response to determining that the time corresponding to the time information in the element to be confirmed is the same as the current time The difference between the times is less than or equal to the preset duration, determining whether the number of retries in the element to be confirmed is greater than the threshold of the number of retries, and in response to determining that the number of retries is greater than the threshold of the number of retries, the element to be confirmed is stored in the dead letter queue, and delete the element to be confirmed from the queue to be confirmed, and delete the element to be confirmed from the queue to be confirmed in response to determining that the feedback information indicates that the identification information has been confirmed.

In a second aspect, an embodiment of the present application provides an apparatus for storing information, the apparatus comprising: a receiving unit configured to receive at least one identification information to be stored; a storage unit configured to obtain information from the at least one identification to be stored Select the identification information to be stored in the information, and perform the following storage steps: in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a selected identification information to be stored and the time information of the current time. Queue element; determine whether the queue length of the above-mentioned target queue is less than the length threshold; in response to determining yes, store the generated queue element in the above-mentioned target queue; in response to determining no, establish a new queue, and store the generated queue element in the above-mentioned queue element new queue, adding the above-mentioned new queue to the above-mentioned queue group, and determining the above-mentioned new queue as the target queue; determining whether there is unselected identification information to be stored in the at least one identification information to be stored; in response to determining that it does not exist, output the above queue group.

In some embodiments, the above-mentioned apparatus further includes: a continuing unit configured to, in response to determining that there is unselected identification information to be stored in the at least one identification information to be stored, reselect from the at least one identification information to be stored For the identification information to be stored that has not been selected, continue to perform the above storage step.

In some embodiments, the above-mentioned storage unit further includes: a first deletion unit configured to delete the same elements as the queue elements in the above-mentioned target queue in the queues in the above-mentioned queue group except the above-mentioned target queue.

In some embodiments, the above-mentioned storage unit further includes: a second deletion unit configured to sequentially acquire a preset number of queue elements from the above-mentioned target queue, and for the acquired queue elements in the preset number of queue elements , generating a to-be-confirmed element based on a preset number of retries, identification information and time information in the queue element, adding the generated to-be-confirmed element to the to-be-confirmed queue, and deleting the queue element from the target queue.

In some embodiments, the above-mentioned storage unit further includes: a third deletion unit, configured to, for the to-be-confirmed element in the above-mentioned to-be-confirmed queue, send the identification information in the to-be-confirmed element to the client of the communication connection, and receive from the to-be-confirmed element. The feedback information sent by the above-mentioned client for the above-mentioned identification information, in response to determining that the above-mentioned identification information is not confirmed according to the above-mentioned feedback information, the number of retries in the element to be confirmed is increased by a predetermined value, in response to determining that the element to be confirmed is in the element. The difference between the time corresponding to the time information and the current time is less than or equal to the preset duration, determine whether the number of retries in the element to be confirmed is greater than the threshold of the number of retries, and in response to determining that the number of retries is greater than the threshold of the number of retries, the The element to be confirmed is stored in the dead letter queue, and the element to be confirmed is deleted from the queue to be confirmed. In response to determining that the feedback information indicates that the identification information has been confirmed, the element to be confirmed is deleted from the queue to be confirmed. .

In a third aspect, an embodiment of the present application provides a server, including: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors , causing one or more processors to implement the method of any one of the embodiments of the method for storing information.

In a fourth aspect, an embodiment of the present application provides a computer-readable medium on which a computer program is stored, and when the program is executed by a processor, implements the method in any one of the embodiments of the method for storing information.

For the method and apparatus for storing information provided by the embodiments of the present application, firstly, at least one piece of identification information to be stored is received. Then, select the identification information to be stored from the above at least one identification information to be stored, and perform the following storage steps: in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate the selected identification information to be stored. the queue elements of the identification information and the time information of the current time, determine whether the queue length of the above-mentioned target queue is less than the length threshold; in response to determining yes, store the generated queue elements in the above-mentioned target queue; in response to determining no, establish a new queue, The generated queue element is stored in the above-mentioned new queue, the above-mentioned new queue is added to the above-mentioned queue group, and the above-mentioned new queue is determined as the target queue; It is determined whether there is unselected identification information to be stored in the at least one identification information to be stored ; in response to determining that it does not exist, output the above queue group. In the method and device of this embodiment, the identification information to be stored that is not included in the target queue in the queue group is stored in the target queue or the new queue and the new queue is added to the queue group, so that the queue elements in the queue do not have The same identification information can achieve the effect of deduplication in the queue, which helps to save storage space.

Description of drawings

Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

FIG. 1 is an exemplary system architecture diagram to which an embodiment of the present application may be applied;

Figure 2 is a flowchart of one embodiment of a method for storing information according to the present application;

3 is a schematic diagram of an application scenario of the method for storing information according to an embodiment of the present application;

Figure 4 is a flowchart of yet another embodiment of a method for storing information according to the present application;

5 is a schematic structural diagram of an embodiment of an apparatus for storing information according to the present application;

FIG. 6 is a schematic structural diagram of a computer system suitable for implementing the server of the embodiment of the present application.

Detailed ways

The present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the related invention, but not to limit the invention. In addition, it should be noted that, for the convenience of description, only the parts related to the related invention are shown in the drawings.

It should be noted that the embodiments in the present application and the features of the embodiments may be combined with each other in the case of no conflict. The present application will be described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.

FIG. 1 shows an exemplary system architecture 100 of a method for storing information or an apparatus for storing information to which embodiments of the present application may be applied.

As shown in FIG. 1 , the system architecture 100 may include terminal devices 101 , 102 , and 103 , a network 104 and a server 105 . The network 104 is a medium used to provide a communication link between the terminal devices 101 , 102 , 103 and the server 105 . The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The terminal devices 101, 102, and 103 interact with the server 105 through the network 104 to receive or send messages and the like. Various applications can be installed on the terminal devices 101 , 102 and 103 , such as shopping applications, search applications, instant messaging tools, email clients, social platform software, text editing applications, browser applications, reading applications, etc. .

The terminal devices 101, 102, and 103 may be hardware or software. When the terminal devices 101, 102, and 103 are hardware, they can be various electronic devices, including but not limited to smart phones, tablet computers, e-book readers, laptop computers, desktop computers, and the like. When the terminal devices 101, 102, and 103 are software, they can be installed in the electronic devices listed above. It can be implemented as a plurality of software or software modules (for example, used to provide shopping services), or can be implemented as a single software or software module. There is no specific limitation here.

The server 105 may be a server that provides various services, such as an information storage server applied on the terminal devices 101 , 102 , and 103 . The information storage server may, in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a queue element including the selected identification information to be stored and the time information of the current time, and store the generated queue element , and output the queue group.

It should be noted that the method for storing information provided by the embodiments of the present application is generally executed by the server 105 , and accordingly, the apparatus for storing information is generally set in the server 105 .

It should be understood that the numbers of terminal devices, networks and servers in FIG. 1 are merely illustrative. There can be any number of terminal devices, networks and servers according to implementation needs.

With continued reference to FIG. 2, a flow 200 of one embodiment of a method for storing information according to the present application is shown. The method for storing information includes the following steps:

Step 201: Receive at least one identification information to be stored.

In this embodiment, the execution body of the method for storing information (for example, the server 105 shown in FIG. 1 ) may receive the identification information to be stored in various ways. For example, the execution subject may directly receive the identification information to be stored stored therein from the client (eg, the terminal devices 101 , 102 , and 103 shown in FIG. 1 ) connected in communication. For another example, the execution body may receive the identification information to be stored stored in the database server (not shown in FIG. 1 ) through a wired connection or a wireless connection.

In this embodiment, the identification information may include various symbols for identification, such as numbers. The identification information to be stored represents various symbols to be stored for identification.

Step 202: Select identification information to be stored from at least one identification information to be stored.

In this embodiment, the execution subject may select the identification information to be stored from the at least one identification information to be stored received in step 201 , and execute the storage steps from step 203 to step 208 . The selection method of the identification information to be stored is not limited in this application. For example, the identification information to be stored may be randomly selected, or the identification information to be stored in the at least one identification information to be stored may be sorted to select the identification information to be stored in sequence.

Step 203, in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a queue element including the selected identification information to be stored and time information of the current time.

In this embodiment, the queue group is a queue group composed of several queues. A queue is composed of several queue elements. Queue elements include identification information and time information. The target queue may be the queue specified in the queue group, eg, the latest established current queue. It should be pointed out that the queue group may be empty. In this case, first, a new queue is created as a target queue and added to the queue group, and then the content of step 203 is executed.

In this embodiment, the fact that the selected identification information to be stored is not included in the target queue means that the selected identification information to be stored is not included in the queue elements in the target queue.

In this embodiment, the time information of the current time may be various information used to indicate the time of the current moment. As an example, the time information may be time data accurate to nanoseconds.

Step 204: Determine whether the queue length of the target queue is less than a length threshold.

In this embodiment, the queue length refers to the number of elements in the queue. The length threshold may be a data value preset by a technician, for example, the length threshold may be 100,000.

Step 205, in response to determining yes, store the generated queue element to the target queue.

In this embodiment, the above-mentioned storing the generated queue elements in the target queue refers to adding the queue elements to the target queue.

Step 206 , in response to determining No, establish a new queue, store the generated queue elements in the new queue, add the new queue to the queue group, and determine the new queue as the target queue.

In this embodiment, the execution body adds queue elements to the new queue. Then, add the new queue to the queue group. After that, use the new queue as the new target queue.

Step 207: Determine whether there is unselected identification information to be stored in the at least one identification information to be stored.

In this embodiment, if the execution subject determines that there is no unselected identification information to be stored in the at least one identification information to be stored, step 208 may be continued. If the execution body determines that there is unselected identification information to be stored in the at least one identification information to be stored, it can reselect the identification information to be stored that has not been selected from the at least one identification information to be stored, and continue to perform the above storage step .

Step 208, in response to determining that it does not exist, output the queue group.

In this embodiment, the output method may be that the execution body stores the queue group locally, or may send it to the above-mentioned terminal device or database server.

In some optional implementations of this embodiment, after outputting the queue group in response to determining that it does not exist, the storing step further includes: deleting the queues in the queue group other than the target queue that are the same as the above-mentioned queues. The same element as the queue element in the target queue.

Specifically, for a queue element in the above-mentioned target queue, for a queue in the above-mentioned queue group other than the above-mentioned target queue, determine whether the identification information in the above-mentioned queue element exists in the queue; in response to determining that the identification information exists in the queue , delete the identification information from the queue.

Through the above-mentioned step of deleting the same elements in the queues in the above-mentioned queue group as the queue elements in the above-mentioned target queue in the queues other than the above-mentioned target queue, the queue elements in the queue group can be deduplicated between queues, and further deduplication can further Save storage space.

Referring further to FIG. 3 , FIG. 3 is a schematic diagram of an application scenario of the method for storing information according to this embodiment.

In the application scenario of FIG. 3 , the server 302 that provides background support for shopping applications in the terminal device 301 can run a method for storing information, including:

First, the server 302 may receive at least one number information {1001} of the terminal device 301 . After that, the server 302 can select 1001 from the above at least one number information {1001}, and perform the following storage step: the server 302 determines the current queue in the queue group 303 in response to {(1003, 11:10:20), (1004, 11:10:21), (1005, 11:10:22), (1006, 11:10:23)} 3031 does not include 1001, and generates a queue element that includes 1001 and the current time 15:10:20 (1001, 15:10:20), determine whether the queue length of the current queue 3031 is less than the length threshold 5. In response to determining yes, the server 302 stores the generated queue element (1001, 15:10:20) to the above current queue {(1003, 11:10:20), (1004, 11:10:21), (1005) , 11:10:22), (1006, 11:10:23), (1001, 15:10:20)}3031. Determine whether there is unselected number information in the at least one number information {1001}. In response to determining that it does not exist, the queue group described above is stored to the database server 304 .

In the method for storing information in this embodiment, the server 302 receives at least one identification information to be stored. Afterwards, the server 302 can select the identification information to be stored from the above-mentioned at least one identification information to be stored, and perform the following storage steps: if the server 302 determines that the selected identification information to be stored is not included in the target queue in the queue group, then generate the identification information including The selected queue element to be stored identification information and the time information of the current time, and determine whether the queue length of the above-mentioned target queue is less than the length threshold; Then, if the server 302 determines that it is, the generated queue element is stored in the above-mentioned target queue; If the server 302 determines No, establish a new queue, store the generated queue elements in the above-mentioned new queue, add the above-mentioned new queue to the above-mentioned queue group, and determine the above-mentioned new queue as the target queue; If the server 302 determines that the above-mentioned at least one identifier to be stored is Whether there is unselected identification information to be stored in the information; if it is determined that it does not exist, the server 302 outputs the above queue group. The method for storing information in this embodiment enriches the way of storing information. By de-duplicating elements in the queue, storage space can be saved, which is beneficial to reduce repeated processing when the identification information in the queue is subsequently processed. times, thereby helping to improve the efficiency of subsequent processing.

With further reference to Figure 4, a flow 400 of yet another embodiment of a method for storing information is shown. The process 400 of the method for storing information includes the following steps:

Step 401: Receive at least one identification information to be stored.

Step 402: Select identification information to be stored from at least one identification information to be stored.

Step 403, in response to determining that the target queue in the queue group does not include the selected identification information to be stored, a queue element including the selected identification information to be stored and time information of the current time is generated.

Step 404: Determine whether the queue length of the target queue is less than a length threshold.

Step 405, in response to determining yes, store the generated queue element to the target queue.

Step 406, in response to determining no, establish a new queue, store the generated queue elements in the new queue, add the new queue to the queue group, and determine the new queue as the target queue.

Step 407: Determine whether there is unselected identification information to be stored in the at least one identification information to be stored.

Step 408, in response to determining that it does not exist, output the queue group.

In this embodiment, the specific operations of steps 401 to 408 are basically the same as the operations of steps 201 to 208 in the embodiment shown in FIG. 2 , and details are not repeated here.

Step 409, sequentially acquire a preset number of queue elements from the target queue, and for the acquired queue elements in the preset number of queue elements, based on the preset number of retries, the identification information and time in the queue elements The information generates a to-be-confirmed element, adds the generated to-be-confirmed element to the to-be-confirmed queue, and deletes the queue element from the target queue.

In this embodiment, the above-mentioned order acquisition refers to the acquisition in the order of the queue. The above preset number can be set according to actual needs, for example, 10. The above preset number of retries can be set according to actual needs, for example, 0. The above element to be confirmed includes three attributes: the number of retries, identification information and time information. The identification information in the above elements to be confirmed is used for consumption. If the identification information in the above elements to be confirmed has been consumed, the execution subject will receive the information to confirm the consumption, which means that the above elements to be confirmed have been confirmed. The above-mentioned queue to be confirmed is a queue for storing elements to be confirmed, and the above-mentioned queue to be confirmed may be empty during initialization. The above "consumption" usually refers to the consumption of the message queue in the database.

In some optional implementation manners of this embodiment, the above-mentioned storing step may further include: for the to-be-confirmed element in the above-mentioned to-be-confirmed queue, sending the identification information in the to-be-confirmed element to the client of the communication connection, and receiving the information from the to-be-confirmed element. The feedback information sent by the above-mentioned client for the above-mentioned identification information, in response to determining that the above-mentioned identification information is not confirmed according to the above-mentioned feedback information, the number of retries in the element to be confirmed is increased by a predetermined value, in response to determining that the element to be confirmed is in the element. The difference between the time corresponding to the time information and the current time is less than or equal to the preset duration, determine whether the number of retries in the element to be confirmed is greater than the threshold of the number of retries, and in response to determining that the number of retries is greater than the threshold of the number of retries, the The element to be confirmed is stored in the dead letter queue, and the element to be confirmed is deleted from the queue to be confirmed. In response to determining that the feedback information indicates that the identification information has been confirmed, the element to be confirmed is deleted from the queue to be confirmed. . The above predetermined value can be set according to actual needs, for example, 1. The preset duration can be set according to actual needs, for example, 2 hours. The threshold for the number of retries can be set according to actual needs, for example, 10. The above-mentioned dead-letter queue usually includes a queue for storing failed or expired messages. The above identification information has been confirmed usually means that the above identification information has been successfully processed by the client. In the field of database technology, the above queue to be confirmed can be understood as a queue to be consumed. The above feedback information can be understood as the information whether it has been consumed.

Optionally, in response to determining that the number of retries is less than or equal to the threshold of the number of retries, the time information of the element to be confirmed is modified to the current time, and stored in the next queue to be confirmed. Wherein, the above-mentioned current time may be various time information used to indicate the current time. As an example, the time information may be time data accurate to nanoseconds.

It can be seen from FIG. 4 that, compared with the embodiment corresponding to FIG. 2 , the process 400 of the method for storing information in this embodiment highlights the generation of queue elements based on the preset number of retries and the target queue. Acknowledging an element, and adding a pending element to the pending queue, and then removing the queue element from the target queue. Therefore, the solution described in this embodiment can apply queue elements to the queue to be confirmed on the basis of the queue group obtained in the embodiment shown in FIG. 2 . In the application process, the queue elements that have generated the elements to be confirmed are deleted from the target queue, and the queue elements in the target queue will not be reused, thus helping to improve the reliability of the to-be-confirmed queue.

With further reference to FIG. 5 , as an implementation of the methods shown in the above figures, the present application provides an embodiment of an apparatus for storing information. The apparatus embodiment corresponds to the method embodiment shown in FIG. 2 . The device can be specifically applied to various electronic devices.

As shown in FIG. 5 , the above-mentioned apparatus 500 for storing information in this embodiment includes: a receiving unit 501 configured to receive at least one identification information to be stored; and a storage unit 502 configured to receive at least one identification information to be stored from the above-mentioned at least one identification information Select the identification information to be stored in the middle, and perform the following storage steps: in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a queue that includes the selected identification information to be stored and the time information of the current time element; determine whether the queue length of the above-mentioned target queue is less than the length threshold; in response to determining yes, store the generated queue elements in the above-mentioned target queue; in response to determining no, establish a new queue, and store the generated queue elements in the above-mentioned new queue. Queue, adding the above-mentioned new queue to the above-mentioned queue group, and determining the above-mentioned new queue as a target queue; determining whether there is unselected identification information to be stored in the at least one identification information to be stored; in response to determining that it does not exist, output the above-mentioned queue Group.

In some optional implementations of this embodiment, the above-mentioned apparatus further includes: a continuation unit (not shown in FIG. 5 ), configured to respond to determining that there is an unselected pending identification information in the at least one identification information to be stored The identification information is stored, the identification information to be stored that has not been selected is reselected from the at least one identification information to be stored, and the above storage step is continued.

In some optional implementations of this embodiment, the above-mentioned storage unit further includes: a first deletion unit (not shown in FIG. 5 ), configured to delete, The same element as the queue element in the target queue above.

In some optional implementations of this embodiment, the above-mentioned storage unit further includes: a second deletion unit (not shown in FIG. 5 ), configured to sequentially acquire a preset number of queue elements from the above-mentioned target queue, For the acquired queue elements in the preset number of queue elements, generate the to-be-confirmed elements based on the preset number of retries, the identification information and time information in the queue elements, and add the generated to-be-confirmed elements to the to-be-confirmed elements Queue, delete the queue element from the above target queue.

Optionally, the above-mentioned storage unit also includes: a third deletion unit (not shown in FIG. 5 ), configured to send the identification information in the to-be-confirmed element to the communication connection for the to-be-confirmed element in the above-mentioned to-be-confirmed queue the client, receives the feedback information for the above identification information sent from the above client, in response to determining that the above identification information is not confirmed according to the above feedback information, increases the number of retries in the element to be confirmed by a predetermined value, in response to Determine whether the difference between the time corresponding to the time information in the element to be confirmed and the current time is less than or equal to the preset duration, determine whether the number of retries in the element to be confirmed is greater than the threshold of the number of retries, in response to determining that the number of retries is greater than The threshold of the number of retries, the element to be confirmed is stored in the dead letter queue, and the element to be confirmed is deleted from the above-mentioned queue to be confirmed. Deleted from the queue to be confirmed above.

In the apparatus provided by the above embodiments of the present application, the receiving unit 501 is configured to receive at least one piece of identification information to be stored. The storage unit 502 is configured to select the identification information to be stored from the above-mentioned at least one identification information to be stored, and execute the following storage steps: first, in response to determining that the target queue in the queue group does not include the selected identification information to be stored, Generate a queue element including the selected identification information to be stored and the time information of the current time; Then, determine whether the queue length of the above-mentioned target queue is less than the length threshold; Afterwards, in response to determining that, the generated queue element is stored in the above-mentioned target Then, in response to determining No, establish a new queue, store the generated queue elements in the above-mentioned new queue, add the above-mentioned new queue to the above-mentioned queue group, and determine the above-mentioned new queue as the target queue; Whether there is unselected identification information to be stored in the stored identification information; finally, in response to determining that it does not exist, the above-mentioned queue group is output. In this way, the deduplication queue group in the queue can be obtained, the deduplication method of the message queue is enriched, the storage space is saved, and the efficiency of the application of the message queue is improved.

Referring to FIG. 6 below, it shows a schematic structural diagram of a computer system 600 suitable for implementing the server of the embodiment of the present application. The server shown in FIG. 6 is only an example, and should not impose any limitations on the functions and scope of use of the embodiments of the present application.

As shown in FIG. 6, a computer system 600 includes a central processing unit (CPU) 601, which can be loaded into a random access memory (RAM) 603 according to a program stored in a read only memory (ROM) 602 or a program from a storage section 608 Instead, various appropriate actions and processes are performed. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601 , the ROM 602 , and the RAM 603 are connected to each other through a bus 604 . An input/output (I/O) interface 605 is also connected to bus 604 .

The following components are connected to the I/O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc. ; and a communication section 609 including a network interface card such as a LAN card, a modem, and the like. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I/O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 610 as needed so that a computer program read therefrom is installed into the storage section 608 as needed.

In particular, according to 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 carried on a computer-readable medium, the computer program containing program code for performing the method illustrated in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network via the communication portion 609 and/or installed from the removable medium 611 . When the computer program is executed by the central processing unit (CPU) 601, the above-described functions defined in the method of the present application are performed.

It should be noted that the computer-readable medium described in this application may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

In this application, a 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. In this application, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code therein. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, wireless, wireline, optical fiber 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 application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more functions for implementing the specified logical function(s) executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks 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 is also noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented in dedicated hardware-based systems that perform the specified functions or operations , or can be implemented in a combination of dedicated hardware and computer instructions.

The units involved in the embodiments of the present application may be implemented in a software manner, and may also be implemented in a hardware manner. The described unit can also be provided in the processor, for example, it can be described as: a processor includes a receiving unit and a storage unit. Wherein, the names of these units do not constitute a limitation on the unit itself under certain circumstances, for example, the receiving unit may also be described as "receiving at least one unit of identification information to be stored".

As another aspect, the present application also provides a computer-readable medium. The computer-readable medium may be included in the server described in the above embodiments, or may exist independently without being assembled into the server. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the server, the server is made to: receive at least one identification information to be stored; select the identification information to be stored from the at least one identification information to be stored Identification information, and perform the following storage steps: in response to determining that the target queue in the queue group does not include the selected identification information to be stored, generate a queue element that includes the selected identification information to be stored and the time information of the current time; determine the above Whether the queue length of the target queue is less than the length threshold; in response to determining yes, store the generated queue elements in the above-mentioned target queue; in response to determining no, establish a new queue, store the generated queue elements in the above-mentioned new queue, and store the above-mentioned queue elements in the above-mentioned new queue. The new queue is added to the above-mentioned queue group, and the above-mentioned new queue is determined as the target queue; it is determined whether there is unselected identification information to be stored in the at least one identification information to be stored; in response to determining that it does not exist, the above-mentioned queue group is output.

The above description is only a preferred embodiment of the present application and an illustration of the applied technical principles. Those skilled in the art should understand that the scope of the invention involved in this application is not limited to the technical solution formed by the specific combination of the above technical features, and should also cover the above technical features or Other technical solutions formed by any combination of its equivalent features. For example, a technical solution is formed by replacing the above-mentioned features with the technical features disclosed in this application (but not limited to) with similar functions.

Claims (12)

1. A method for storing information, comprising:

receiving at least one identification information to be stored;

selecting identification information to be stored from the at least one identification information to be stored, and executing the following storage steps: generating a queue element comprising the selected identification information to be stored and the time information of the current time in response to determining that the target queue in the queue group does not comprise the selected identification information to be stored; determining whether a queue length of the target queue is less than a length threshold; in response to determining yes, storing the generated queue element to the target queue; in response to determining no, establishing a new queue, storing the generated queue elements to the new queue, adding the new queue to the group of queues, and determining the new queue as a target queue; determining whether unselected identification information to be stored exists in the at least one identification information to be stored; in response to determining that there is no, outputting the set of queues.

2. The method of claim 1, wherein the method further comprises:

and in response to determining that the unselected identification information to be stored exists in the at least one identification information to be stored, reselecting the unselected identification information to be stored from the at least one identification information to be stored, and continuing to execute the storing step.

3. The method of any of claims 1-2, wherein after the outputting the set of queues in response to determining the absence, the storing step further comprises:

deleting the same queue elements in the queues in the queue group except the target queue as the queue elements in the target queue.

4. The method of any of claims 1-2, wherein after the outputting the set of queues in response to determining the absence, the storing step further comprises:

sequentially acquiring a preset number of queue elements from the target queue, generating elements to be confirmed based on a preset retry number, identification information in the queue elements and time information for the queue elements in the acquired preset number of queue elements, adding the generated elements to be confirmed to the queue to be confirmed, and deleting the queue elements from the target queue.

5. The method of claim 4, wherein the storing step further comprises:

for an element to be confirmed in the queue to be confirmed, sending identification information in the element to be confirmed to a client connected to communication, receiving feedback information sent from the client and aiming at the identification information, increasing a retry number in the element to be confirmed by a preset value in response to determining that the identification information is not confirmed according to the feedback information, determining whether the retry number in the element to be confirmed is larger than a retry number threshold value or not in response to determining that a difference value between a time corresponding to time information in the element to be confirmed and a current time is smaller than or equal to a preset time length, and storing the element to be confirmed into a dead mail queue in response to determining that the retry number is larger than the retry number threshold value, and deleting the element to be confirmed from the queue to be confirmed, and in response to determining that the feedback information represents that the identification information is confirmed, deleting the element to be confirmed from the queue to be confirmed.

6. An apparatus for storing information, comprising:

a receiving unit configured to receive at least one identification information to be stored;

a storage unit configured to select identification information to be stored from the at least one identification information to be stored, and perform the following storing steps: generating a queue element comprising the selected identification information to be stored and the time information of the current time in response to determining that the target queue in the queue group does not comprise the selected identification information to be stored; determining whether a queue length of the target queue is less than a length threshold; in response to determining yes, storing the generated queue element to the target queue; in response to determining no, establishing a new queue, storing the generated queue elements to the new queue, adding the new queue to the group of queues, and determining the new queue as a target queue; determining whether unselected identification information to be stored exists in the at least one identification information to be stored; in response to determining that there is no, outputting the set of queues.

7. The apparatus of claim 6, wherein the apparatus further comprises:

and a continuing unit configured to, in response to determining that the at least one piece of identification information to be stored does not have the identification information to be stored that is not selected, reselect the identification information to be stored that is not selected from the at least one piece of identification information to be stored, and continue to perform the storing step.

8. The apparatus of one of claims 6-7, wherein the storage unit further comprises:

a first deletion unit configured to delete an element in a queue other than the target queue in the queue group that is the same as a queue element in the target queue.

9. The apparatus of one of claims 6-7, wherein the storage unit further comprises:

a second deletion unit configured to sequentially acquire a preset number of queue elements from the target queue, generate an element to be confirmed based on a preset number of retries, identification information in the queue element, and time information for the queue element among the acquired preset number of queue elements, add the generated element to be confirmed to the queue to be confirmed, and delete the queue element from the target queue.

10. The apparatus of claim 9, wherein the storage unit further comprises:

a third deletion unit configured to, for an element to be confirmed in the queue to be confirmed, send identification information in the element to be confirmed to a communicatively connected client, receive feedback information sent from the client for the identification information, increase a number of retries in the element to be confirmed by a predetermined value in response to determining that the identification information is not confirmed according to the feedback information, determine whether the number of retries in the element to be confirmed is greater than a threshold number of retries in response to determining that a difference between a time corresponding to time information in the element to be confirmed and a current time is less than or equal to a preset time period, store the element to be confirmed in a dead mail queue in response to determining that the number of retries is greater than the threshold number of retries, and delete the element to be confirmed from the queue to be confirmed in response to determining that the feedback information indicates that the identification information has been confirmed, and deleting the element to be confirmed from the queue to be confirmed.

11. A server, comprising:

one or more processors;

a storage device having one or more programs stored thereon,

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

12. 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-5.

Images