CN114840542A - Score ranking processing method, device and equipment and computer readable storage medium - Google Patents

Abstract

The application provides a score ranking processing method, which comprises the following steps: if at least two users have the same target score in the user scores of the users participating in the target activity, respectively generating a timestamp score for the at least two users, wherein the timestamp score reflects the time when the corresponding user reaches the target score; ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users. Therefore, when ranking a plurality of users with the same target score, the time information of each user reaching the target score is considered, the timestamp score of each user is generated by introducing a time factor, the score ranking is performed on each user based on the size of the timestamp score, and the reasonability of the score ranking can be ensured. The application also provides a score ranking processing device, equipment and a computer readable storage medium.

Description

Score ranking processing method, device and equipment and computer readable storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a computer-readable storage medium for ranking scores.

Background

In project development, some problem of point ranking is often encountered, and due to the instantaneity of the ranking list, the ranking needs to be queried and presented at the first time.

In the ranking list, for example, in the ranking list of some large competitions, because the number of participants is large, a plurality of users with the same score often appear, however, how to reasonably rank the users with the same score is a problem to be solved urgently at present.

Disclosure of Invention

The application provides a score ranking processing method, a score ranking processing device, score ranking equipment and a computer readable storage medium, which can reasonably rank a plurality of same user scores.

In a first aspect, the present application provides a score ranking processing method, including:

if at least two users have the same target score in the user scores of the users participating in the target activity, generating a timestamp score for the at least two users respectively, wherein the timestamp score reflects the time of the corresponding user reaching the target score;

and ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

Optionally, generating a timestamp score for each of the at least two users includes:

and for each user of the at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

Optionally, the ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users includes:

determining the sequence of the at least two users reaching the target score according to the respective timestamp scores of the at least two users;

and ranking the respective target scores of the at least two users according to the sequence.

Optionally, the method further includes:

acquiring the current score of the first user in the target activity;

if the first user does not have a relevant rank in the score ranking list, adding the current score of the first user to the score ranking list by adopting a zadd function of a Redis database;

and if the first user has relevant ranking in the score ranking list, updating the historical score of the first user in the score ranking list by adopting a zincrby function of a Redis database.

Optionally, the method further includes:

and if a query request aiming at the ranking of the second user in the score ranking list is detected, querying the ranking of the second user by adopting a zrevrank function of a Redis database.

Optionally, the method further includes:

and if a query request aiming at the user identification of one ranking section in the score ranking list is detected, querying each user identification in the ranking section by adopting a zrevrange function of the Redis database.

In a second aspect, the present application provides a score ranking processing apparatus, including:

the timestamp generation unit is used for respectively generating a timestamp score for at least two users if at least two users have the same target score in the user scores of the users participating in the target activity, wherein the timestamp score reflects the time of the corresponding user reaching the target score;

and the score ranking unit is used for ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

Optionally, when the timestamp generating unit generates a timestamp score for each of the at least two users, the timestamp generating unit is specifically configured to:

and for each user of the at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

Optionally, the score ranking unit is specifically configured to:

determining the sequence of the at least two users reaching the target score according to the respective timestamp scores of the at least two users; and ranking the respective target scores of the at least two users according to the sequence.

Optionally, the apparatus further comprises:

the score acquisition unit is used for acquiring the current score of the first user in the target activity;

the adding ranking unit is used for adding the current score of the first user to the score ranking list by adopting a zadd function of a Redis database if the first user does not have related ranking in the score ranking list;

and the score updating unit is used for updating the historical score of the first user in the score ranking list by adopting a zincrby function of a Redis database if the first user has a relevant ranking in the score ranking list.

Optionally, the apparatus further comprises:

the first query unit is used for querying the ranking of the second user by adopting a zrevrank function of a Redis database if a query request aiming at the ranking of the second user in the score ranking list is detected.

Optionally, the apparatus further comprises:

and the second query unit is used for querying each user identifier in the ranking section by adopting a zrevrange function of the Redis database if a query request aiming at the user identifier of one ranking section in the score ranking list is detected.

In a third aspect, the present application provides an electronic device, comprising: a processor, a memory;

the memory for storing a computer program;

the processor is used for executing the score ranking processing method by calling the computer program.

In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described score ranking processing method.

In the technical scheme provided by the application, if at least two users have the same target score in the user scores of the users participating in the target activity, a timestamp score is respectively generated for the at least two users, and the time of the corresponding user reaching the target score is reflected by the timestamp score; ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users. Therefore, when ranking a plurality of users with the same target score, the time information of each user reaching the target score is considered, the timestamp score of each user is generated by introducing a time factor, the score ranking is performed on each user based on the size of the timestamp score, and the reasonability of the score ranking can be ensured.

Drawings

FIG. 1 is a schematic view of an activity scenario illustrated in the present application;

fig. 2 is a schematic flow chart of a score ranking processing method according to the present application;

fig. 3 is a schematic diagram illustrating a component of a ranking processing apparatus according to the present application;

fig. 4 is a schematic structural diagram of an electronic device shown in the present application.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.

Before the embodiments of the present application are described, an application scenario of the embodiments of the present application is first described exemplarily. Referring to the schematic diagram of the activity scene shown in fig. 1, the activity scene may be a large or small network competition scene or other actual combat scene requiring score ranking. In the activity scenario, a user-player participating in the activity may submit an answer to a topic; the system will verify whether the answer has been made to the question, and if not, the operation is terminated; if the answer is answered, judging whether the answer is correct; if the answer is wrong, the operation is terminated; if the answer is correct, storing the answer of the user; in addition, the system can not only give out relevant scores based on the correct answers, so that the score ranking list is updated and displayed, but also record the correct answers and display the real-time fighting condition of the activity.

The score ranking processing method provided by the embodiment of the present application is specifically described below.

Referring to fig. 2, a schematic flowchart of a score ranking processing method provided in an embodiment of the present application is shown, where the method includes the following steps S201 to S202:

s201: if at least two users have the same target score in the user scores of the users participating in the target activity, generating a timestamp score for the at least two users respectively, wherein the size of the timestamp score reflects the time when the corresponding user reaches the target score.

It should be noted that, the embodiment of the present application does not limit the activity type of the target activity, and the target activity may be any type of network activity that performs score ranking, for example, a network game with a certain number of participants.

For each user participating in the target activity, the user may generate a user score during the target activity, for example, the user score is a match score for the activity event, the user score may change throughout the activity, that is, the user score may become larger or smaller, and the system may record the current latest score of the user and may also record the previous historical score.

In practice, there may be two or more users whose current scores (i.e. latest scores) are the same, and for the sake of distinction, the same score is defined herein as a target score, and in order to solve the ranking between these users, the present embodiment introduces a concept of time to assist these users in ranking. For example, when the scores of a plurality of users are the same and the same score is a target score, the user who reaches the target score first is ranked ahead, and in a specific implementation, a timestamp score may be generated for each user with the same score, and the time when the corresponding user reaches the target score is reflected by the size of the timestamp score, so that the users have the same target score but different timestamp scores because the users reach the target score at different times.

In an implementation manner of the embodiment of the present application, the "generating a timestamp score for each of the at least two users" in S201 may include: and for each user of at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

In this implementation, for each user with the same target score, the timestamp score for that user may be calculated according to the following formula:

F＝f*100000000+(99999999-(t1-t2))

wherein F is the timestamp score of the user; f is a target score; t1 is the specific time when the user gets the target score; t2 is the starting time for ranking the scores for each user with the same score.

For example, assuming that the target scores for user 1 and user 2 are both 8 points, then assume that:

the specific time when the user 1 obtains the target score is t1 ═ 10110816, wherein 10110816 represents 11 th day, 08 minutes and 16 seconds; the time for the user 2 to obtain the target score is t 1-10110830, wherein 10110830 means 11 points on 10 days, 08 minutes and 30 seconds; the start time t2 of score ranking for user 1 and user 2 is 10120000, where 10120000 represents 10 days, 12 points, 0 minutes and 0 seconds.

Substituting t2 and t1 for user 1 into the above formula, and substituting t2 and t1 for user 2 into the above formula, it can be calculated that the timestamp score F for user 1 is greater than the timestamp score F for user 2, which indicates that user 1 obtained the target score F first and user 2 obtained the target score F later.

S202: and ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

In the embodiment of the application, for the users with the same target score, the specific ranking of the target scores of the users in the score leaderboard needs to be determined based on the timestamp scores of the users. It can be understood that the scores and the ranks of other users are also in the score ranking list, and the other users may rank according to the scores.

In an implementation manner of the embodiment of the present application, the "ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users" in S202 may include: determining the sequence of the target scores reached by the at least two users according to the respective timestamp scores of the at least two users; and ranking the respective target scores of the at least two users according to the sequence.

In this implementation, the timestamp scores of the at least two users are different, due to the different times to reach the target score. The timestamp scores may be made to be in direct proportion to the time information, that is, the larger the timestamp score is, it indicates that the user corresponding to the timestamp score reaches the target score first, and therefore, the timestamp scores of these users may be sorted from large to small, and the target score of the user corresponding to the timestamp score sorted before is ranked first, and the target score of the user corresponding to the timestamp score sorted after is ranked after, such as the example in S201 described above, the score of the user 1 is ranked before, and the score of the user 2 is ranked after. Conversely, the timestamp score may be inversely proportional to the time information, and after ranking, the users who obtained the target score earlier may be ranked first, and the users who obtained the target score later may be ranked later.

It should be noted that if there are at least two users with the same timestamp score, the users may be ranked according to other rules, for example, users with steadily increasing historical scores rank before, and users with too large fluctuation of historical scores rank after.

It should be further noted that, the present application may sort users with the same score based on the timestamp score only; or respectively generating timestamp scores for all users participating in the target activity when generating the ranking list, and ranking the scores of all users according to the size of the timestamp scores.

In addition, in project development, some problem of point ranking is often encountered, because of the real-time nature of the ranking list, the ranking needs to be queried and presented at the first time. In the ranking list, since the ranking of one user is raised by x, the ranking of x +1 users (including the user) will be changed, and if the existing traditional database (such as MySQL) is adopted to realize the ranking list, when the number of users is large, frequent modification of the database will be caused, so that the performance of the database is reduced. In fact, the traditional database (such as MySQL) is adopted to store the list data, so that the method is suitable for small-sized competitions with few participants, and for large-sized competitions, the database performance is reduced due to frequent operation of the database, so that the problems of data loss, data incapability of displaying and the like are caused.

When the prior art is adopted for ranking query, the generated user data is stored in a database, if the ranking of the current user needs to be queried, the score of the current user needs to be queried firstly, and then the number of the users with the score larger than that of the current user is queried to calculate the ranking of the current user. This query approach results in a slow query speed for the ranked list of items, a poor user experience, and a large match where one list is queried for several minutes. By optimizing the integral ranking algorithm, the embodiment of the application reduces the pressure of the database, improves the ranking calculation speed and improves the ranking display speed.

In specific implementation, the ranking can be realized by utilizing Redis, which is a high-performance key-value database, so that the functions of adding the ranking, updating the score and inquiring the ranking can be realized, the data processing of large events can be supported, and the method and the device have the advantages of high stability, high response speed and the like. Namely, interaction with a database is reduced, and query times are reduced, so that query speed is increased, and quick response is realized; because the interaction with the database is reduced, the pressure of the database is reduced, and the stability of the database is improved.

The following describes "add rank" and "update score":

the method provided by the embodiment of the application further comprises the following steps: acquiring the current score of the first user in the target activity; if the first user does not have a relevant rank in the score ranking list, adding the current score of the first user to the score ranking list by adopting a zadd function of a Redis database; and if the first user has relevant ranking in the score ranking list, updating the historical score of the first user in the score ranking list by adopting a zincrby function of the Redis database.

Specifically, for each user participating in the target activity, the user is defined herein as the first user. When the first user obtains the score (i.e. the current latest score), the score of the first user is added to the score ranking list through the zadd function, before that, the zadd function can be adopted to check whether the first user has a relevant rank in the score ranking list, if no relevant rank exists, the current score of the first user is directly added to the score ranking list, so that the function of adding the rank is realized.

On the contrary, if the first user has a relevant rank in the score ranking list, the score of the first user is changed and the score is added or subtracted, and a zincrby function can be adopted to update the historical score of the first user in the score ranking list based on the name of the ranking list (the score ranking list), the score increment (the score increment can be positive or negative) and the identifier of the first user, so that the function of updating the score is realized.

The following introduces "query ranking":

the method provided by the embodiment of the application further comprises the following steps: and if a query request aiming at the ranking of the second user in the score ranking list is detected, querying the ranking of the second user by adopting a zrevrank function of the Redis database. And if a query request aiming at the user identification of one ranking section in the score ranking list is detected, querying each user identification in the ranking section by adopting a zrevrange function of the Redis database.

Specifically, in order to query the ranking of a certain person (i.e., the second user), a zrevrank function may be adopted, and the score of the second user is specifically ranked on the order of the second user based on the ranking list (score ranking list) name and the identification of the second user. In order to inquire which users exist in a ranking section, a zrevrange function can be adopted to acquire user identifications of all users in the ranking section based on a ranking list (score ranking list) name, a starting position of the ranking section and an ending position of the ranking section, wherein the ranking section can be N (such as 10) persons in the front ranking, M (such as 10) persons in the back ranking, or Q persons in some other ranking section (such as 5 persons in the 5 th to 10 th ranking); for example, if 10 top-ranked people are queried, the start position of the ranking segment is 1, and the end position of the ranking segment is 10.

In practical applications, the first user and the second user may be the same user or different users.

In the score ranking processing method provided by the embodiment of the application, if at least two users have the same target score in the user scores of the users participating in the target activity, a timestamp score is respectively generated for the at least two users, and the time of the corresponding user reaching the target score is reflected by the timestamp score; ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users. Therefore, when ranking a plurality of users with the same target score, the time information of each user reaching the target score is considered, the timestamp score of each user is generated by introducing a time factor, and the score ranking is performed on each user based on the size of the timestamp score, so that the reasonability of the score ranking can be ensured.

Referring to fig. 3, a schematic composition diagram of a score ranking processing apparatus provided in an embodiment of the present application is shown, where the apparatus includes:

atimestamp generating unit 310, configured to generate, if at least two users have the same target score among the user scores of the users participating in the target activity, a timestamp score for each of the at least two users, where a size of the timestamp score reflects a time when the corresponding user reaches the target score;

thescore ranking unit 320 is configured to rank the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

In an implementation manner of the embodiment of the present application, when thetimestamp generating unit 310 generates a timestamp score for each of the at least two users, it is specifically configured to:

and for each user of the at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

In an implementation manner of the embodiment of the present application, thescore ranking unit 320 is specifically configured to:

determining the sequence of the at least two users reaching the target score according to the respective timestamp scores of the at least two users; and ranking the respective target scores of the at least two users according to the sequence.

In an implementation manner of the embodiment of the present application, the apparatus further includes:

the score acquisition unit is used for acquiring the current score of the first user in the target activity;

the adding ranking unit is used for adding the current score of the first user to the score ranking list by adopting a zadd function of a Redis database if the first user does not have related ranking in the score ranking list;

and the score updating unit is used for updating the historical score of the first user in the score ranking list by adopting a zincrby function of a Redis database if the first user has a relevant ranking in the score ranking list.

In an implementation manner of the embodiment of the present application, the apparatus further includes:

the first query unit is used for querying the ranking of the second user by adopting a zrevrank function of a Redis database if a query request aiming at the ranking of the second user in the score ranking list is detected.

In an implementation manner of the embodiment of the present application, the apparatus further includes:

and the second query unit is used for querying each user identifier in the ranking section by adopting a zrevrange function of the Redis database if a query request aiming at the user identifier of one ranking section in the score ranking list is detected.

The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.

For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.

An embodiment of the present application further provides an electronic device, a schematic structural diagram of the electronic device is shown in fig. 4, where theelectronic device 4000 includes at least oneprocessor 4001, amemory 4002, and abus 4003, and the at least oneprocessor 4001 is electrically connected to thememory 4002; thememory 4002 is configured to store at least one computer-executable instruction, and theprocessor 4001 is configured to execute the at least one computer-executable instruction so as to perform the steps of any one of the ranking processing methods as provided in any one of the embodiments or any one of the alternative embodiments of the present application.

Further, theprocessor 4001 may be an FPGA (Field-Programmable Gate Array) or other devices with logic processing capability, such as an MCU (micro controller Unit) and a CPU (Central processing Unit).

By applying the embodiment of the application, when a plurality of users with the same target score are ranked, the time information of each user reaching the target score is considered, the timestamp score of each user is generated by introducing a time factor, and the score ranking is performed on each user based on the size of the timestamp score, so that the reasonability of the score ranking can be ensured.

The embodiments of the present application further provide another computer-readable storage medium, which stores a computer program, where the computer program is used for implementing, when executed by a processor, the steps of any one of the ranking processing methods provided in any one of the embodiments or any one of the alternative embodiments of the present application.

The computer-readable storage medium provided by the embodiments of the present application includes, but is not limited to, any type of disk including floppy disks, hard disks, optical disks, CD-ROMs, and magneto-optical disks, ROMs (Read-Only memories), RAMs (Random Access memories), EPROMs (Erasable Programmable Read-Only memories), EEPROMs (Electrically Erasable Programmable Read-Only memories), flash memories, magnetic cards, or optical cards. That is, a readable storage medium includes any medium that stores or transmits information in a form readable by a device (e.g., a computer).

By applying the embodiment of the application, when a plurality of users with the same target score are ranked, the time information of each user reaching the target score is considered, the timestamp score of each user is generated by introducing a time factor, and the score ranking is performed on each user based on the size of the timestamp score, so that the reasonability of the score ranking can be ensured.

The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.

Claims (10)

1. A score ranking processing method is characterized by comprising the following steps:

if at least two users have the same target score in the user scores of the users participating in the target activity, generating a timestamp score for the at least two users respectively, wherein the timestamp score reflects the time of the corresponding user reaching the target score;

and ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

2. The method of claim 1, wherein generating a timestamp score for each of the at least two users comprises:

and for each user of the at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

3. The method of claim 1, wherein ranking the respective target scores of the at least two users according to their respective timestamp scores comprises:

determining the sequence of the at least two users reaching the target score according to the respective timestamp scores of the at least two users;

and ranking the respective target scores of the at least two users according to the sequence.

4. The method according to any one of claims 1-3, further comprising:

obtaining a current score of a first user in the target activity;

if the first user does not have a relevant rank in the score ranking list, adding the current score of the first user to the score ranking list by adopting a zadd function of a Redis database;

and if the first user has relevant ranking in the score ranking list, updating the historical score of the first user in the score ranking list by adopting a zincrby function of a Redis database.

5. The method according to any one of claims 1-3, further comprising:

and if a query request aiming at the ranking of the second user in the score ranking list is detected, querying the ranking of the second user by adopting a zrevrank function of a Redis database.

6. The method according to any one of claims 1-3, further comprising:

and if a query request aiming at the user identification of one ranking section in the score ranking list is detected, querying each user identification in the ranking section by adopting a zrevrange function of the Redis database.

7. A score ranking processing apparatus, comprising:

the timestamp generation unit is used for respectively generating a timestamp score for at least two users if at least two users have the same target score in the user scores of the users participating in the target activity, wherein the timestamp score reflects the time of the corresponding user reaching the target score;

and the score ranking unit is used for ranking the respective target scores of the at least two users according to the respective timestamp scores of the at least two users.

8. The apparatus according to claim 7, wherein the timestamp generating unit, when generating a timestamp score for each of the at least two users, is specifically configured to:

and for each user of the at least two users, calculating the timestamp score of the user according to the target score of the user and the time information of the target score acquired by the user.

9. An electronic device, comprising: a processor, a memory;

the memory for storing a computer program;

the processor, configured to execute the score ranking processing method according to any one of claims 1 to 6 by calling the computer program.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the score ranking processing method of any one of claims 1 to 6.

Images