CN114860189B - Data processing method, device, server and readable storage medium - Google Patents

Abstract

The embodiment of the invention provides a data processing method, a device, a server and a readable storage medium, wherein the method comprises the following steps: acquiring an index to be sequenced; judging whether the index to be ordered is an existing ordering index or not, and sending a data scheduling instruction to a first queue or a second queue based on a judging result of the index to be ordered; controlling the first queue or the second queue to generate sorting data based on the index to be sorted based on the data scheduling instruction; and controlling the first queue or the second queue to provide the sequencing data. Therefore, compared with the mode of providing the ordering data only through the fixed queue, the mode in the embodiment of the invention is more flexible, and the throughput of the first queue and the second queue is not reduced, so that the ordering effect on the ordering data is better.

Description

Data processing method, device, server and readable storage medium

Technical Field

The present invention relates to the field of data processing technology, and in particular to a data processing method, device, server and readable storage medium.

Background Art

At present, with the development of electronic technology, electronic devices have played an increasingly important role in people's lives, and electronic devices will acquire and output a large amount of data during use. Therefore, in order for electronic devices to better acquire data, the server needs to sort the above data. However, in actual use, the inventor found that the prior art has the following problems: since the server usually uses a fixed queue to sort the data, this will lead to a decrease in data throughput, so that the server has a poor data sorting effect.

Summary of the invention

The purpose of the embodiments of the present invention is to provide a data processing method, device, server and readable storage medium to solve the problem that the server has poor data sorting effect. The specific technical solution is as follows:

In a first aspect of the present invention, a data processing method is provided, comprising:

Get the index to be sorted;

Determine whether the to-be-sorted index is an existing sorting index, and send a data scheduling instruction to the first queue or the second queue based on the determination result of the to-be-sorted index;

Controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction;

Control the first queue or the second queue to provide the sorted data.

In a second aspect of the present invention, a data processing device is provided, which is applied to a server. The data processing device includes:

The acquisition module is used to obtain the indicators to be sorted;

A judgment module, used for judging whether the to-be-sorted index is an existing sorting index, and sending a data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted index;

A first control module, configured to control the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction;

The second control module is used to control the first queue or the second queue to provide the sorting data.

In another aspect of the present invention, a server is provided, comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus;

Memory, used to store computer programs;

The processor is used to implement any of the above-mentioned data processing methods when executing the program stored in the memory.

In another aspect of the present invention, a computer-readable storage medium is provided, wherein instructions are stored in the computer-readable storage medium, and when the computer-readable storage medium is run on a computer, the computer executes any of the above-mentioned data processing methods.

In yet another aspect of the present invention, a computer program product comprising instructions is provided, which, when executed on a computer, enables the computer to execute any of the above-mentioned data processing methods.

The data processing method provided in the embodiment of the present invention can determine whether the corresponding first queue or second queue provides sorting data based on the judgment result of whether the index to be sorted is an existing sorting index. Therefore, compared with the method of providing sorting data only through a fixed queue, the method in the embodiment of the present invention is more flexible and will not reduce the throughput of the first queue and the second queue, thereby achieving a better sorting effect on the sorting data.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art are briefly introduced below.

FIG1 is a flow chart of a data processing method provided by an embodiment of the present invention;

2 is a flow chart of determining the state of a flag bit of a first queue in a data processing method provided by an embodiment of the present invention;

3 is a flow chart of function switching between a first queue and a second queue in a data processing method provided by an embodiment of the present invention;

FIG4 is a flow chart of switching of sorting indicators in a data processing method provided by an embodiment of the present invention;

FIG5 is a schematic diagram of data sorting in a data processing method provided by an embodiment of the present invention;

FIG6 is a schematic diagram of the structure of a data processing device provided by an embodiment of the present invention;

FIG. 7 is a schematic diagram of the structure of a server provided in an embodiment of the present invention.

DETAILED DESCRIPTION

The technical solutions in the embodiments of the present invention will be described below in conjunction with the accompanying drawings in the embodiments of the present invention.

Referring to FIG. 1 , FIG. 1 is a flow chart of a data processing method provided by an embodiment of the present invention. As shown in FIG. 1 , the method includes the following steps:

Step 101, obtaining the index to be sorted;

The index to be sorted may be obtained through a data interface in the server, and the data interface may be an interface between two modules in the server, which is not specifically limited here.

Wherein, as an optional implementation manner, the index to be sorted includes: any one of: playback volume, exposure volume, like volume and comment volume.

Among them, the exposure amount can be understood as the refresh amount. For example, when the pre-stored data is a video, the exposure amount can be understood as the total number of times the user refreshes to the video but does not wait until the video starts playing or the playing time is within the preset time, that is, refreshes to other videos.

In this way, since there are many types of indicators to be sorted, the way of sorting data based on the indicators to be sorted is more diversified and more flexible, thereby achieving a better data sorting effect.

Step 102: determine whether the to-be-sorted index is an existing sorting index, and send a data scheduling instruction to the first queue or the second queue based on the determination result of the to-be-sorted index;

Step 103: Based on the data scheduling instruction, control the first queue or the second queue to generate sorting data based on the to-be-sorted indicator;

Step 104: Control the first queue or the second queue to provide the sorted data.

The working principle of the embodiment of the present invention can be seen in the following description:

In the embodiment of the present invention, the first queue or the second queue corresponding to the sorting data can be determined according to the judgment result of whether the index to be sorted is an existing sorting index. Different judgment results correspond to different queues. In this way, compared with the method of providing sorting data through a fixed queue, the embodiment of the present invention can enhance the flexibility and intelligence of the method of providing sorting data, and will not reduce the throughput of the first queue and the second queue. At the same time, because different judgment results correspond to different queues, that is to say, each judgment result has a unique corresponding queue for providing sorting data, so that the sorting effect of the sorting data is better.

It should be noted that the correspondence between the judgment result and the queue is not specifically limited here. For example, as an optional implementation, when the judgment result is that the indicator to be sorted is not an existing sorting indicator, the second queue can be controlled to provide sorting data; when the indicator to be sorted is an existing sorting indicator, the first queue can be controlled to provide sorting data.

In addition, as another optional implementation, the sending of the data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted indicator includes:

When the to-be-sorted index is not an existing sorting index, sending a first data scheduling instruction to the first queue, the flag bit of the first queue being a first identifier;

The controlling the first queue or the second queue to generate sorting data based on the to-be-sorted indicator based on the data scheduling instruction includes:

Assigning a value corresponding to the to-be-sorted index to the to-be-sorted data based on the first data scheduling instruction;

Controlling the first queue to sort the data to be sorted based on the value corresponding to the to-be-sorted indicator to generate first sorted data;

The controlling the first queue or the second queue to provide the sorted data comprises:

When the flag bit of the first queue is switched to the second flag, the first queue is controlled to provide the first sorted data.

In an implementation manner of the present invention, when the index to be sorted is not an existing sorting index, the data to be sorted can be first assigned a value corresponding to the index to be sorted, and the data to be sorted can be sorted based on the value corresponding to the index to be sorted to generate first sorting data, and then the first queue is controlled to provide the first sorting data. In this way, the first sorting data can be sorted based on the value corresponding to the index to be sorted, so that the sorting result of the first sorting data is more accurate.

It should be noted that the first identifier and the second identifier may be different, and when the flag of the first queue is the first identifier, the first queue may be used to sort the data. When the flag of the first queue is the second identifier, the first queue may be used to transmit data, for example, to receive data or to send data (also referred to as pop-up data).

It should be noted that the existing sorting index may refer to a sorting index that already exists locally, and the non-existing sorting index may refer to a sorting index that does not exist locally.

In addition, assigning the value corresponding to the to-be-sorted index to the to-be-sorted data may be executed by the first queue, and of course, may also be executed by other components, which is not specifically limited here.

In addition, when the data to be sorted is sorted, it can be sorted according to a priority strategy or a sorting strategy, and the above priority strategy or sorting strategy can be understood as: arranging in order from large to small or from small to large according to the corresponding numerical values.

In addition, the value corresponding to the index to be sorted can be called a model class, which can be generated according to the code generation library cglib. In this way, the accuracy of the value corresponding to the index to be sorted is higher and the generation method is simpler.

As another optional implementation, the sending of the data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted indicator further includes:

When the to-be-sorted indicator is an existing sorting indicator, sending a second data scheduling instruction to the second queue;

The step of controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction further includes:

Controlling the second queue to sort the data to be sorted based on the second data scheduling instruction to generate second sorted data;

The controlling the first queue or the second queue to provide the sorted data further includes:

When the flag bit of the second queue is the second identifier, the second queue is controlled to provide the second sorted data.

In the implementation manner of the present invention, when the index to be sorted is an existing sorting index, the second queue can be directly controlled to provide the second sorting data, so that the provision method of the sorting data when the index to be sorted is not an existing sorting index can be distinguished, and the flexibility and intelligence of the provision method of the sorting data can be enhanced. In addition, when the index to be sorted is an existing sorting index, the second queue can be directly controlled to provide the second sorting data, so that there is no need to assign a value to the data to be sorted, so that the provision speed of the second sorting data can also be improved.

It should be noted that the first identifier and the second identifier can refer to the corresponding descriptions in the above implementation manner, and will not be described in detail here.

For example: referring to Figure 4, the field name of the indicator to be sorted (which can also be understood as the value of the indicator to be sorted) can be obtained, and then through logical judgment, whether there is the field name of the indicator to be sorted in the data to be sorted (that is, whether the field of the indicator to be sorted is a newly added field). If not, it is necessary to assign the value corresponding to the indicator to be sorted to each piece of data to be sorted, call the sorting logic, and sort the data to be sorted according to the value corresponding to the indicator to be sorted. If yes, directly call the sorting logic and sort the data to be sorted according to the value corresponding to the indicator to be sorted.

The above-mentioned sorting logic may be the above-mentioned priority strategy or sorting strategy.

In addition, when each piece of data to be sorted has a value corresponding to the index to be sorted, when the sorting index is switched (for example: switching from the current sorting index to the index to be sorted), the corresponding field of the sorting index to be switched (that is, the index to be sorted) can be obtained by reflection, and then sorting can be performed according to the corresponding field.

It should be noted that when the data to be sorted does not have the value of the indicator to be sorted, but after each piece of data in the data to be sorted is assigned the value of the corresponding indicator to be sorted, before the data to be sorted is sorted based on the value of the indicator to be sorted, the sorting strategy can be obtained first, and then the data to be sorted can be sorted based on the sorting strategy and the value of the indicator to be sorted.

Similarly, when the data to be sorted has the value of the index to be sorted, before sorting the data to be sorted based on the value of the index to be sorted, the sorting strategy can also be obtained first, and then the pre-stored data can be sorted based on the sorting strategy and the value of the index to be sorted.

The above-mentioned sorting strategy may be a priority strategy, that is, it may include sorting from large to small according to the value of the index to be sorted, and sorting from small to large according to the value of the index to be sorted.

In addition, when sorting the data to be sorted according to the value of the to-be-sorted index, the value of the to-be-sorted index of a certain data can be compared with the values of the to-be-sorted index of other data, so as to sort the data to the corresponding position. For example, referring to FIG5 , each circle can represent a data, the value in the circle can represent the value of the to-be-sorted index of the data, and the value indicated by the arrow can represent the matching order between the data and the data indicated by the circle. For example, if the value of the to-be-sorted index of a certain data is -1, it can be compared with the value in each circle in the order of 507, 506, 505, 504, 503, 502 and 501, and finally determine that -1 is less than 0, so the position of the data should be arranged above the circle indicated by 501.

As an optional implementation, the data to be sorted includes: sorted data and incremental data based on the existing sorting index. In this way, since the data to be sorted includes sorted data and incremental data sorted based on the existing sorting index, the data to be sorted is more comprehensive, and the sorting result is more accurate.

Among them, data sorting can be understood as sorting by period, and the above-mentioned data to be sorted can be understood as data that needs to be sorted in the current period, and the sorting data based on the existing sorting indicators can be understood as the sorting data that has been sorted before the current period, and the incremental data can be understood as: when sorting the above-mentioned sorting data based on the existing sorting indicators, the newly received data (it can also be understood as the data newly received before the current period, but the data that did not participate in the sorting of the previous period).

In addition, since both the first queue and the second queue have flag bits, the functions of the first queue and the second queue can be determined by judging the state of the flag bit of at least one of the first queue and the second queue.

For example: the first queue can be priority queue (priorityQue) A, the second queue can be priorityQueB, and the flag bit of the first queue can be called used_flag_A, and correspondingly, the flag bit of the second queue can be called used_flag_B. In this way, referring to Figure 2, when incremental data is received, the status of used_flag_A and/or used_flag_B can be judged, and the function of the queue corresponding to the flag bit in the correct (true) state in used_flag_A and used_flag_B can be determined as transmitting data, and the function of the queue corresponding to the flag bit in the error (false) state can be determined as sorting. For example: used_flag_A=false, used_flag_B=true, then the first queue is used to sort data, and the second queue is used to transmit data, so that the functions of the first queue and the second queue can be accurately and quickly determined.

It should be noted that transmitting data may refer to sending data or receiving data, and sorting data may refer to sorting data to be sorted.

It should be noted that the functions of the first queue and the second queue may be fixed, or they may be switched to each other.

For example, as an optional implementation, the controlling the first queue or the second queue to provide the sorting data further includes:

Starting from the moment when the flag bit of the first queue is determined to be the first identifier, after a preset period, the flag bit of the first queue is switched to the second identifier, and the flag bit of the second queue is switched from the second identifier to the first identifier.

The specific value of the preset period is not limited here, for example, it can be 10 milliseconds or 1 second, etc. In addition, the value of the preset period can be determined according to the time length for the first queue to complete sorting of the pre-stored data.

In this way, by switching the flag bits of the first queue and the second queue, the functions of the first queue and the second queue are switched, which makes it more flexible to provide sorted data and receive data. At the same time, the functions of the first queue and the second queue can be switched with each other. When one queue fails to sound, the other queue can also implement different functions through switching, thereby ensuring that different functions can be implemented normally, thereby making the stability of the functions better.

For example: after a preset period, the functions of the first queue and the second queue can be switched by reversing the states of the flags corresponding to the first queue and the second queue. For example: referring to FIG3, the flags associated with the first queue and the second queue are reversed, that is, the original states of the flags are used_flagA=true, used_flagB=false, and after the reversal, used_flagA=false, used_flagB=true; then, in this way, the switching of the functions of the first queue and the second queue is completed. Of course, the functions of the first queue and the second queue can be switched again after a preset period, that is, the switching of the functions of the first queue and the second queue can be executed cyclically.

Referring to FIG. 6 , FIG. 6 is a schematic diagram of the structure of a data processing device further provided in an embodiment of the present invention. As shown in FIG. 6 , the data processing device 600 includes:

The acquisition module 601 is used to acquire the index to be sorted;

A judgment module 602 is used to judge whether the to-be-sorted index is an existing sorting index, and send a data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted index;

A first control module 603, configured to control the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction;

The second control module 604 is used to control the first queue or the second queue to provide the sorted data.

Optionally, the judgment module 602 is further configured to send a first data scheduling instruction to the first queue when the to-be-sorted index is not an existing sorting index, and the flag bit of the first queue is a first identifier;

The first control module 603 includes:

An assigning submodule, configured to assign a value corresponding to the to-be-sorted index to the to-be-sorted data based on the first data scheduling instruction;

A control submodule, used for controlling the first queue to sort the data to be sorted based on the value corresponding to the to-be-sorted index to generate first sorted data;

The second control module 604 is further configured to control the first queue to provide the first sorted data when the flag bit of the first queue is switched to a second flag.

Optionally, the judging module 602 is further configured to send a second data scheduling instruction to the second queue when the to-be-sorted indicator is an existing sorted indicator;

The first control module 603 is further configured to control the second queue to sort the data to be sorted based on the second data scheduling instruction to generate second sorted data;

The second control module 604 is further configured to control the second queue to provide the second sorted data when the flag bit of the second queue is a second identifier.

Optionally, the data to be sorted includes: sorted data based on the existing sorting index and incremental data.

Optionally, the second control module 604 further includes:

The switching submodule is used to switch the flag bit of the first queue to the second identifier and switch the flag bit of the second queue from the second identifier to the first identifier after a preset period starting from the moment when the flag bit of the first queue is determined to be the first identifier.

Optionally, the index to be sorted includes: any one of: playback volume, exposure volume, like volume and comment volume.

In this way, the data processing device provided by the embodiment of the present invention can also achieve a better sorting effect on sorted data.

The embodiment of the present invention further provides a server, as shown in FIG. 7 , including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, wherein the processor 701, the communication interface 702, and the memory 703 communicate with each other via the communication bus 704.

Memory 703, used for storing computer programs;

The processor 701 is used to execute the program stored in the memory 703 to implement the following steps:

Get the index to be sorted;

Determine whether the to-be-sorted index is an existing sorting index, and send a data scheduling instruction to the first queue or the second queue based on the determination result of the to-be-sorted index;

Controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction;

Control the first queue or the second queue to provide the sorted data.

Optionally, the processor 701 executes the sending of a data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted indicator, including:

When the to-be-sorted index is not an existing sorting index, sending a first data scheduling instruction to the first queue, the flag bit of the first queue being a first identifier;

The controlling the first queue or the second queue to generate sorting data based on the to-be-sorted indicator based on the data scheduling instruction includes:

Assigning a value corresponding to the to-be-sorted index to the to-be-sorted data based on the first data scheduling instruction;

Controlling the first queue to sort the data to be sorted based on the value corresponding to the to-be-sorted indicator to generate first sorted data;

The controlling the first queue or the second queue to provide the sorted data comprises:

When the flag bit of the first queue is switched to the second flag, the first queue is controlled to provide the first sorted data.

Optionally, the processor 701 executes the sending of a data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted indicator, including:

When the to-be-sorted indicator is an existing sorting indicator, sending a second data scheduling instruction to the second queue;

The step of controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction further includes:

Controlling the second queue to sort the data to be sorted based on the second data scheduling instruction to generate second sorted data;

The controlling the first queue or the second queue to provide the sorted data further includes:

When the flag bit of the second queue is the second identifier, the second queue is controlled to provide the second sorted data.

Optionally, the data to be sorted includes: sorted data based on the existing sorting index and incremental data.

Optionally, the controlling the first queue or the second queue to provide the sorting data executed by the processor 701 further includes:

Starting from the moment when the flag bit of the first queue is determined to be the first identifier, after a preset period, the flag bit of the first queue is switched to the second identifier, and the flag bit of the second queue is switched from the second identifier to the first identifier.

Optionally, the index to be sorted includes: any one of: playback volume, exposure volume, like volume and comment volume.

The communication bus mentioned in the above terminal can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The communication bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

The communication interface is used for communication between the above terminal and other devices.

The memory may include a random access memory (RAM) or a non-volatile memory, such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

In another embodiment of the present invention, a computer-readable storage medium is provided. The computer-readable storage medium stores instructions. When the instructions are executed on a computer, the computer executes the data processing method described in any one of the above embodiments.

In another embodiment of the present invention, a computer program product including instructions is provided. When the computer program product is run on a computer, the computer executes the data processing method described in any one of the above embodiments.

In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present invention is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk Solid State Disk (SSD)), etc.

It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Each embodiment in this specification is described in a related manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

The above description is only a preferred embodiment of the present invention and is not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention are included in the protection scope of the present invention.

Claims (10)

1. A data processing method, characterized in that it is applied to a server, and the method comprises: Get the index to be sorted; Determine whether the to-be-sorted index is an existing sorting index, and send a data scheduling instruction to the first queue or the second queue based on the determination result of the to-be-sorted index; Controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction; Controlling the first queue or the second queue to provide the sorted data; The sending of the data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted indicator includes: When the to-be-sorted index is not an existing sorting index, sending a first data scheduling instruction to the first queue, the flag bit of the first queue being a first identifier; In a case where the to-be-sorted index is an existing sorting index, a second data scheduling instruction is sent to the second queue. 2. The method according to claim 1, characterized in that the step of controlling the first queue or the second queue to generate sorting data based on the to-be-sorted indicator based on the data scheduling instruction comprises: Assigning a value corresponding to the to-be-sorted index to the to-be-sorted data based on the first data scheduling instruction; Controlling the first queue to sort the data to be sorted based on the value corresponding to the to-be-sorted indicator to generate first sorted data; The controlling the first queue or the second queue to provide the sorted data comprises: When the flag bit of the first queue is switched to the second flag, the first queue is controlled to provide the first sorted data. 3. The method according to claim 1, characterized in that the step of controlling the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction further comprises: Controlling the second queue to sort the data to be sorted based on the second data scheduling instruction to generate second sorted data; The controlling the first queue or the second queue to provide the sorted data further includes: When the flag bit of the second queue is the second identifier, the second queue is controlled to provide the second sorted data. 4. The method according to claim 2 or 3 is characterized in that the data to be sorted includes: sorted data based on the existing sorting index and incremental data. 5. The method according to claim 2 or 3, characterized in that the controlling the first queue or the second queue to provide the sorted data further comprises: Starting from the moment when the flag bit of the first queue is determined to be the first identifier, after a preset period, the flag bit of the first queue is switched to the second identifier, and the flag bit of the second queue is switched from the second identifier to the first identifier. 6. The method according to claim 1 is characterized in that the indicator to be sorted includes: any one of: playback volume, exposure volume, like volume and comment volume. 7. A data processing device, characterized in that it is applied to a server, and the data processing device comprises: The acquisition module is used to obtain the indicators to be sorted; A judgment module, used for judging whether the to-be-sorted index is an existing sorting index, and sending a data scheduling instruction to the first queue or the second queue based on the judgment result of the to-be-sorted index; A first control module, configured to control the first queue or the second queue to generate sorted data based on the to-be-sorted indicator based on the data scheduling instruction; A second control module, used for controlling the first queue or the second queue to provide the sorting data; The judgment module is further configured to send a first data scheduling instruction to the first queue when the to-be-sorted index is not an existing sorting index, and the flag bit of the first queue is a first identifier; The judgment module is further configured to send a second data scheduling instruction to the second queue when the to-be-sorted indicator is an existing sorting indicator. 8. The data processing device according to claim 7, wherein the first control module comprises: An assigning submodule, configured to assign a value corresponding to the to-be-sorted index to the to-be-sorted data based on the first data scheduling instruction; A control submodule, used for controlling the first queue to sort the data to be sorted based on the value corresponding to the to-be-sorted index to generate first sorted data; The second control module is further configured to control the first queue to provide the first sorting data when the flag bit of the first queue is switched to a second flag. 9. A server, characterized in that it comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; Memory, used to store computer programs; A processor, for implementing the method steps described in any one of claims 1 to 6 when executing a program stored in a memory. 10. A computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.