CN113194339A - Live list generation method and device, electronic equipment and readable storage medium - Google Patents

Live list generation method and device, electronic equipment and readable storage medium Download PDF

Info

Publication number
CN113194339A
CN113194339A CN202110554015.2A CN202110554015A CN113194339A CN 113194339 A CN113194339 A CN 113194339A CN 202110554015 A CN202110554015 A CN 202110554015A CN 113194339 A CN113194339 A CN 113194339A
Authority
CN
China
Prior art keywords
time
list
live
task
numerical value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110554015.2A
Other languages
Chinese (zh)
Inventor
赵明露
黄俊杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Huya Technology Co Ltd
Original Assignee
Guangzhou Huya Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangzhou Huya Technology Co Ltd filed Critical Guangzhou Huya Technology Co Ltd
Priority to CN202110554015.2A priority Critical patent/CN113194339A/en
Publication of CN113194339A publication Critical patent/CN113194339A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/21Server components or server architectures
    • H04N21/218Source of audio or video content, e.g. local disk arrays
    • H04N21/2187Live feed
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/235Processing of additional data, e.g. scrambling of additional data or processing content descriptors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/24Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26291Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists for providing content or additional data updates, e.g. updating software modules, stored at the client

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application provides a live list generation method and device, electronic equipment and a readable storage medium, based on configuration information of a task to be created, respective multiple items of detail data of multiple users on a live broadcast platform are obtained, the multiple items of detail data are spliced according to preset splicing rules to obtain list numerical values, then the list numerical values of the multiple users are sequenced according to preset sequencing rules, and then corresponding live list is generated based on the sequenced list numerical values. According to the scheme, the plurality of items of detailed data are spliced into the list numerical values, sorting is performed based on the list numerical values, sorting is directly achieved through the one-dimensional list numerical values, data under a plurality of fields in the SQL database are not needed to be combined for sorting, on the basis of reducing storage cost, the complexity of query is reduced, and the purposes of improving processing efficiency and coping with high concurrency request quantity are achieved.

Description

Live list generation method and device, electronic equipment and readable storage medium
Technical Field
The application relates to the technical field of live broadcasting, in particular to a live broadcasting list generation method and device, electronic equipment and a readable storage medium.
Background
In the field of network live broadcasting, different live broadcasting lists can embody the information of the dimensions such as popularity of a main broadcast, live broadcasting popularity or user activity in a live broadcasting platform. The live-broadcast list has certain influence on the improvement of the viscosity of the user, so that various live-broadcast lists are often generated in the live-broadcast platform to reflect the ranking condition of different dimensions in the live-broadcast platform.
In the existing live list generation mode, generally, obtained related data is written into a relational database, and various types of data are written into different fields in a data structure. Based on the direct-broadcast list to be generated, the SQL query capability of the relational database is utilized, for example, through the where condition and in combination with the order by statement, so that the data under a plurality of fields are sequenced in a certain mode, and then the corresponding direct-broadcast list is generated. In the way of querying the details of the SQL database in real time to generate the ranking information, under the condition of facing high concurrent requests of users, the calculation pressure on the SQL database is very large, the logic of SQL statements is relatively complex, and particularly when the quantity of related detail data is relatively large, the defect of low efficiency exists.
Disclosure of Invention
The application aims to provide a live list generation method, a live list generation device, an electronic device and a readable storage medium, which can reduce the query complexity on the basis of reducing the storage cost, and achieve the purposes of improving the processing efficiency and coping with high concurrency requests.
The embodiment of the application can be realized as follows:
in a first aspect, the present application provides a live list generation method, where the method includes:
acquiring configuration information of a task to be created;
acquiring respective multiple items of detail data of multiple users on a live broadcast platform according to the configuration information;
splicing the multiple items of detail data of each user according to a preset splicing rule to obtain a list numerical value;
ranking the list numerical values of the users according to a preset ranking rule, and generating the live list corresponding to the task to be created based on the ranked list numerical values.
In an optional embodiment, the detail data comprises integral data and time information when the integral data is obtained;
the step of splicing the multiple detailed data of each user according to a preset splicing rule to obtain a list numerical value comprises the following steps:
for each user, updating the score items contained in the list numerical value obtained in the previous round according to the acquired score data;
obtaining an updated time item according to the acquired time information;
covering the time item in the updated ranking list numerical value of the integral item by using the updated time item to obtain the ranking list numerical value of the round, wherein the integral item and the time item in the ranking list numerical value are sequentially arranged and spliced.
In an optional implementation manner, the step of obtaining an updated time item according to the obtained time information includes:
acquiring task starting time of a task to be created;
calculating a time difference between the obtained time information and the task start time;
and converting the time difference to obtain an updated time item, wherein the smaller the time difference is, the larger the updated time item obtained after conversion is.
In an optional embodiment, the step of converting the time difference to obtain an updated time item includes:
setting a conversion binary number according to the task plan time length of the task to be created;
converting the time difference based on the converted binary number to generate a binary time difference of the same number of bits as the converted binary number;
and performing decimal conversion on the binary time difference to obtain an updated time item.
In an alternative embodiment, the step of calculating the time difference between the obtained time information and the task start time includes:
for each user, obtaining a local time zone of the area where the user is located;
obtaining a reference time zone adopted by the live broadcast platform;
converting the obtained time information into the time information in the local time zone according to the reference time zone and the local time zone;
calculating a time difference between the converted time information and the task start time.
In an optional embodiment, a carry-prevention term is further spliced between the integral term and the time term in the list numerical value, and the carry-prevention term is reset to be between [0,8] after each round of updating of the integral term is completed.
In an optional embodiment, a ranking item is further spliced after the time item in the list numerical value, and the ranking is higher when the numerical value of the ranking item is larger.
In an optional implementation manner, the step of ranking the list values of the multiple users according to a preset ranking rule, and generating the live-broadcast list corresponding to the task to be created based on the ranked list values includes:
writing the list numerical values of the users into a score field in a data structure, and writing the user identification corresponding to each list numerical value into a member field in the data structure;
sorting each user according to a preset sorting rule in the data structure based on the score field and the member field;
and generating a live list corresponding to the task to be created according to the sorting results of the score field and the member field.
In an optional implementation manner, the step of generating the live chart corresponding to the task to be created based on the sorted chart numerical values includes:
responding to an instruction for indicating generation of a live list, and acquiring a sequencing result obtained based on the current latest list numerical value;
and generating a live list corresponding to the task to be created according to the current sequencing result and the current latest list numerical value.
In a second aspect, the present application provides a live list generation apparatus, including:
the first acquisition module is used for acquiring the configuration information of the task to be created;
the second acquisition module is used for acquiring various detailed data of a plurality of users on the live broadcast platform according to the configuration information;
the splicing module is used for splicing the multiple detailed data of each user according to a preset splicing rule to obtain a list numerical value;
the generating module is used for sequencing the list numerical values of the users according to a preset sequencing rule and generating the live list corresponding to the task to be created based on the sequenced list numerical values.
In a third aspect, the present application provides an electronic device comprising one or more storage media and one or more processors in communication with the storage media, the one or more storage media storing processor-executable machine-executable instructions that, when executed by the electronic device, are executed by the processors to perform the method steps of any one of the preceding embodiments.
In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon machine-executable instructions which, when executed, implement the method steps of any one of the preceding embodiments.
The beneficial effects of the embodiment of the application include, for example:
the application provides a live list generation method and device, electronic equipment and a readable storage medium, based on configuration information of a task to be created, respective multiple items of detail data of multiple users on a live broadcast platform are obtained, the multiple items of detail data are spliced according to preset splicing rules to obtain list numerical values, then the list numerical values of the multiple users are sequenced according to preset sequencing rules, and then corresponding live list is generated based on the sequenced list numerical values. According to the scheme, the plurality of items of detailed data are spliced into the list numerical values, sorting is performed based on the list numerical values, sorting is directly achieved through the one-dimensional list numerical values, data under a plurality of fields in the SQL database are not needed to be combined for sorting, on the basis of reducing storage cost, the complexity of query is reduced, and the purposes of improving processing efficiency and coping with high concurrency request quantity are achieved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
FIG. 1 is a table of consumption details of an anchor provided by an embodiment of the present application;
fig. 2 is a schematic view of an application scenario of a live chart generation method provided in the embodiment of the present application;
fig. 3 is a flowchart of a live chart list generation method provided in the embodiment of the present application;
FIG. 4 is a flowchart of sub-steps included in step S130 of FIG. 3;
FIG. 5 is a flowchart of sub-steps included in step S132 of FIG. 4;
FIG. 6 is a flowchart of sub-steps involved in step S1323 of FIG. 5;
FIG. 7 is a flowchart illustrating sub-steps involved in step S1322 in FIG. 5;
fig. 8 is a schematic diagram of time information conversion provided in an embodiment of the present application;
fig. 9 is a block diagram of an electronic device according to an embodiment of the present application;
fig. 10 is a functional module block diagram of a live list generating apparatus according to an embodiment of the present application.
Icon: 100-a live broadcast server; 200-a live broadcast providing terminal; 300-a live broadcast receiving end; 410-a memory; 420-a processor; 430-a live list generating device; 431-a first acquisition module; 432-a second acquisition module; 433-a splicing module; 434 — a generation module.
Detailed Description
Currently, in a live broadcast platform list generation method, generally, the obtained detail data of the user is stored in an SQL database, and various types of detail data are written in different fields of a data structure. For example, if a corresponding list is generated for the level of the anchor's diamond score, the obtained detailed data of the anchor may include the anchor ID, the anchor rating, the time zone of the area where the anchor is located, the diamond score, the time information, and the like, as shown in fig. 1. The various types of detail data are stored under different fields of the data structure.
If the set list generation rule is that the diamond gift points received by the anchor in the activity period are counted and sorted, if the diamond gift points are the same, the diamond gift points are sorted according to the time sequence of local time zones of the country reaching the points, and if the diamond gift points and the time information are the same, the diamond gift points are sorted according to the level of the anchor. If the three are the same, sorting is performed according to the size of the anchor ID.
In the existing method, on the basis of the storage method, under the list generation rule, the list generation rule can be implemented through the SQL query capability of the relational database and the order by syntax, and specifically, the list generation rule can be implemented through the following statements:
select anchor id, diamond score from: (
select anchor id, sum (diamond points) as diamond points, max (time zone conversion function (time zone, time)) as time, min (anchor level) as anchor level from anchor consumption list group by anchor id
) Anchor consumption list by diamond score desc, time desc, anchor rating asc, anchor id asc
As can be seen, in the existing processing manner, since the list generation often needs to be implemented by combining data under multiple fields based on the data structure, in this manner, when a user-oriented highly-concurrent query request is made, the computational pressure on the relational database will be great. Moreover, the logic of the SQL statement is complex, and particularly when the detailed data volume is large, the performance requirement is difficult to meet.
Based on the research findings, the scheme for generating the live list is provided, the list numerical values are obtained by splicing the acquired multiple detailed data of the user according to the preset splicing rule, and then the list data are sequenced according to the preset sequencing rule, so that the live list is generated. According to the scheme, the ranking is realized by directly utilizing the one-dimensional list numerical value, the data under a plurality of fields in the SQL database is not required to be utilized for combining the ranking, the query complexity is reduced on the basis of reducing the storage cost, and the purposes of improving the processing efficiency and coping with high concurrent requests are achieved.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
In the description of the present application, it should be noted that the features in the embodiments of the present application may be combined with each other without conflict.
Please refer to fig. 2, which is a schematic view of an application scenario of the live chart generating method according to the embodiment of the present application, where the scenario includes a live broadcast server 100, a live broadcast provider 200, and a live broadcast receiver 300. The live broadcast providing end 200 and the live broadcast receiving end 300 are respectively in communication connection with the live broadcast server 100.
The live broadcast providing end 200 may be a terminal device (e.g., a mobile phone, a tablet computer, a personal computer, etc.) used by the anchor in live broadcast, and the live broadcast receiving end 300 may be a terminal device (e.g., a mobile phone, a tablet computer, a personal computer, etc.) used by the viewer in live broadcast watching.
The live broadcast server 100 may be a single server or a server cluster composed of a plurality of servers, and the live broadcast server 100 in the live broadcast platform may provide network services for the live broadcast provider 200 and the live broadcast receiver 300. Generally, the live server 100 can receive a live video stream transmitted by the live provider 200 and push the anchor video stream to the live receiver 300, so that the viewer can watch the anchor live video through the live receiver 300.
With reference to fig. 3, an embodiment of the present application further provides a live list generating method applicable to an electronic device, where the electronic device may be the live server 100 described above. Method steps defined by a flow related to the live chart generation method may be implemented by the electronic device. The specific flow shown in fig. 3 will be described in detail below.
Step S110, obtaining the configuration information of the task to be created.
And step S120, acquiring a plurality of items of detail data of a plurality of users on the live broadcast platform according to the configuration information.
And S130, splicing the multiple items of detail data of the users according to a preset splicing rule to obtain a list numerical value.
Step S140, ranking the list numerical values of the users according to a preset ranking rule, and generating the live list corresponding to the task to be created based on the ranked list numerical values.
In this embodiment, the live broadcast server 100 may obtain data of the live broadcast provider 200, such as a main broadcast ID, main broadcast login information, and gift (virtual gift) information received by the main broadcast, and the live broadcast server 100 may also obtain data of the live broadcast receiver 300, such as a viewer ID and viewer login information. The live broadcast server 100 may also obtain data communicated between the live broadcast receiving end 300 and the live broadcast providing end 200, such as gift information given to a certain main broadcast by a certain viewer. The live broadcast server 100 may generate a desired live broadcast list based on the acquired multiple types of information.
The generation and display of the live broadcast list on the live broadcast platform can achieve the purpose of stimulating the consumption of the live broadcast platform and achieve the purposes of improving the viscosity of audiences and improving the enthusiasm of the anchor.
For example, how much of the gift acquired by the anchor may reflect the popularity of the anchor, and generally, the more gifts acquired by live broadcast indicates that the anchor is more popular and the popularity of the anchor is higher. Accordingly, a live list of gift points on the anchor may be generated by ranking the gift points acquired by the anchor.
In addition, as another example, the cumulative number of times the viewer logs on the live platform may reflect the stickiness of the viewer to the live platform, and generally, the more the cumulative number of times the viewer logs on indicates the higher stickiness of the viewer on the live platform. Thus, a sticky live chart for the audience can be generated by cumulatively ranking the number of logins of the audience.
Therefore, in this embodiment, the user may refer to a main broadcast on a live broadcast platform, or may refer to a viewer on the live broadcast platform. In this embodiment, a scheme description is subsequently performed by taking the user as an example of referring to a main broadcast on a live broadcast platform.
In this embodiment, the task to be created may be, for example, a task of generating a live list of the gift points on the anchor. And the configuration information of the task to be created is used for indicating detail data required for creating a live list of the main gift score. For example, in creating a live list of the gift score of the anchor, data such as the gift score of the anchor, time information corresponding to the gift score, and the anchor ID needs to be acquired.
Therefore, based on the required data indicated by the configuration information of the task to be created, multiple items of detail data of multiple anchor broadcasters on the live platform, such as the above gift points, time information corresponding to the gift points, and anchor ID, can be obtained within a period of time of operation of the live platform.
In the existing processing mode, the acquired multiple items of detail data are written into different fields of a data structure, and then query sequencing is performed through an order by syntax. In this embodiment, the obtained multiple items of detail data are spliced according to a preset splicing rule to obtain a list numerical value.
The preset splicing rule may be set based on a sorting requirement of a live list corresponding to the task to be created, for example, the live list takes the height of the gift score as a primary sorting standard, so that the gift score can be used as a first part of the list numerical value, and secondly, takes the time information corresponding to the gift score as a secondary sorting standard, so that the time information is used as a second part of the list numerical value. By analogy, the ranking list values can be obtained by splicing according to the importance of each item detail data in ranking list.
In this embodiment, the obtained list values of the multiple users are ranked according to a preset ranking rule. Since the number of the list is substantially a number type, the predetermined ranking rule may be ranking the numbers in order from high to low or from low to high. And generating a live list corresponding to the task to be created based on the sorted list numerical values.
In this embodiment, a manner that the live list needs to be generated by combining and sorting the data in the multidimensional fields is improved to be a manner that the multiple items of detailed data are spliced into a one-dimensional list numerical value according to a preset splicing rule, and sorting is realized by using the height of the list numerical value, so as to generate the live list. According to the live list generation scheme provided by the embodiment, on the basis of reducing the storage cost, the query complexity is reduced, and the purposes of improving the processing efficiency and coping with high concurrent requests are achieved.
Generally, when generating a live list of the cast-related gift points, it is often important to consider the heights of the cast-related gift points, but if the sizes of the two cast-related gift points are the same, there is a difference in the times at which the two casts reach the same gift points. Generally, a anchor in which the gift score is reached first should be ranked in a list before a anchor in which the gift score is reached later. In order to take the time information into consideration during the sorting process, and thus accurately rank the anchor, in this embodiment, the obtained detail data includes the integral data and the time information when the integral data is obtained.
In this embodiment, the generation of the live list should be generated based on the final result of the data statistics of each anchor within a period of time, that is, the list value should undergo multiple rounds of updating within the period of time. In this embodiment, when the list numerical value is generated for the first time, and when the detail data includes the integral data and the time information, the time information may be directly spliced to the detail data, and then the list numerical value is generated.
When the list value is not generated for the first time, the method can be implemented in the following manner, please refer to fig. 4:
step S131, aiming at each user, updating the score items contained in the list numerical value obtained in the previous round according to the acquired score data.
Step S132, obtaining an updated time item according to the acquired time information.
And step S133, covering the time item in the updated ranking list numerical value of the integral item by using the updated time item to obtain the ranking list numerical value of the round, wherein the integral item and the time item in the ranking list numerical value are sequentially arranged and spliced.
In the present embodiment, for each anchor, when the anchor receives a virtual gift given by an audience, point data corresponding to the virtual gift is obtained accordingly. And, time information for obtaining the point data is recorded, for example, gift point data of 10.5 is obtained by a certain anchor at 2021-04-1010: 00: 00.
And the list numerical value obtained in the previous round of the anchor contains an integral term, and the integral term is obtained by updating integral data obtained in the previous round. That is, currently, the integral of the integral term in the list value should be updated based on the integral term in the previous round and the integral data obtained in the current round.
In this embodiment, the list numerical value further includes a time item, and the time item corresponds to the latest score item.
In the above-described update of the score term in the list numerical value, the entire list numerical value is calculated, that is, not only the score term in the list numerical value is updated but also other time terms are changed, but the change is caused by the update calculation of the score term and is not an accurate update time. Therefore, after the updated time item is calculated, the updated time item is used for covering the time item in the list numerical value after the score item is updated, and the latest list numerical value in the current round is obtained.
In this embodiment, the score term and the time term in the list numerical value are sequentially arranged and spliced, for example, the list numerical value is the score term and the time term.
In this embodiment, the write of the list numerical value can be realized by using the zset data structure in the redis, and as can be seen from the above, when the score term in the list numerical value is updated, the update calculation is performed on the whole list numerical value, and the score term can be increased on the basis of the previous list numerical value by the command of "zincrby", for example. However, due to the problem of double addition calculation precision of redis, the influence of the latter term value of the integral term on the accuracy of updating the integral term due to the calculation carry may occur.
Based on the above consideration, in the present embodiment, a carry-prevention term is further spliced between the integral term and the time term in the list numerical value, and the carry-prevention term is reset to be between [0,8] after each round of updating of the integral term is completed. Thus, when the integral term is updated, even if the subsequent term of the integral term, such as the time term, has carry, the carry can only carry to the carry-preventing term, the carry-preventing term can only reach 9 at most, and the problem that the accuracy of the integral term is influenced because the carry is further carried to the integral term can not occur.
On the basis that the list numerical value contains the integral term, the carry-over term and the time term, in order to avoid the situation that the three splicing terms are the same and cannot be sorted, in this embodiment, the ranking term is spliced behind the time term in the list numerical value. The grade item is spliced after the time item, and the grade item is higher when the numerical value of the grade item is larger.
Thus, when the sorting can be realized by the integral term, the sorting can be realized by the height of the integral term. Where the integral terms are the same, then the ordering may be implemented based on the time term. In the case where the integral term and the time term are the same, the sorting may be implemented based on the rank term.
In this embodiment, generally, the ranking is higher as the integral term is larger, and if the integral terms are the same, the anchor ranking that arrives at the integral term earlier should be higher, but since the time information is represented numerically, the later time value is larger, and the earlier time value is smaller, and the numerical value obtained by directly converting the time information is difficult to accurately represent the actual ranking of the anchor, in this embodiment, the obtained time information is converted to obtain a time term that can be consistent with the ranking rule of the integral terms.
Referring to fig. 5, in the present embodiment, the conversion of the time information can be implemented by the following ways:
step S1321, a task start time of the task to be created is acquired.
Step S1322 is to calculate a time difference between the obtained time information and the task start time.
And step S1323, converting the time difference to obtain an updated time item, wherein the smaller the time difference is, the larger the updated time item obtained after conversion is.
In this embodiment, the task start time is a time for starting to generate the list value based on the detail data of the user, for example, statistics on the data may start from 2021-04-0110: 00:00, and the time is the task start time. The time information is the time information when the integral data is obtained at a certain time, for example, 2021-04-1010: 00:00, the time is the time information.
The time difference between the time information and the task starting time is calculated, and for a certain task to be created, the task starting time is fixed, the larger the time difference is, the later the time point represented by the time information is, and thus the rule that the higher the time reaching the same integral term is, the higher the ranking is not met. Therefore, the time difference can be converted into an updated time item, and the rule of the conversion is that the smaller the time difference is, the larger the converted time item is. In this way, when the same integral term is reached, the earlier arrival time is converted into a larger time term, and the later arrival time is converted into a smaller time term, so that the rule of ranking based on the time terms can be satisfied.
Referring to fig. 6, in the present embodiment, the following conversion strategy can be adopted to convert the obtained time difference into an updated time item.
And step S13231, setting a conversion binary number according to the task plan time length of the task to be created.
Step S13232, converting the time difference based on the converted binary number to generate a binary time difference having the same number of bits as the converted binary number.
And step S13233, performing decimal conversion on the binary time difference to obtain an updated time item.
Generally, statistics on the data that generates the live listing are typically controlled within a certain time frame, such as one month, two months, and so on. That is, the mission plan duration for the mission to be created may be one month, two months, etc. The time length difference between each piece of time information obtained subsequently and the task start time of the task to be created does not exceed the time span of one month or two months. Accordingly, the magnitude of the time difference will be within a range of values.
In this embodiment, the conversion binary number is set based on the mission plan duration, that is, the binary number is set to a time span sufficient to represent the mission plan duration in terms of the number of bits. For example, if the mission plan time is 25 days, the conversion binary number may be set to a 21-bit binary number, and if the mission plan time is 100 days, the conversion binary number may be set to a 23-bit binary number.
The time difference obtained above is a decimal number, and the time difference may be first converted into a binary number. After the time difference is converted into a binary number, the bits may not be the same as the converted binary number. The converted binary number may be decremented by one and the remainder of the converted time difference and the decremented converted binary number may be generated to produce a binary time difference of the same number of bits as the converted binary number. The rule of the binary time difference is not changed from the rule of the binary time difference, so that the binary time difference can be subtracted from the converted binary number, and the obtained result is subjected to decimal conversion, so that the updated time item opposite to the rule of the binary time difference can be obtained.
In this embodiment, by the above conversion manner, the time difference in a certain time range can be converted into the updated time item, and the size rule of the time item is opposite to the size rule of the time difference, that is, the larger the time difference is, the smaller the converted time item is, and the smaller the time difference is, the larger the converted time item is. It should be noted that, the present embodiment is not limited to the above conversion method, and may be set according to actual requirements as long as the size rule of the obtained time item is opposite to the size rule of the time difference.
In addition, in this embodiment, if the live broadcast platform is globally oriented, the anchor on the live broadcast platform is located in different areas in different time zones around the world. The time information acquired by the live platform is marked by a unified standard adopted by the live platform, that is, for example, two anchor broadcasters with different time zones, the two anchor broadcasters respectively acquire the point data at local time points 2021-04-1010: 00:00, but because the two time zones have a time zone difference, the marks of the trigger time of the point data of the two anchor broadcasters by the live platform are different. In this way, the time zone difference causes the same time point for the user side and the time information is marked as different time information on the live broadcast platform, which affects the fairness of the list.
In order to achieve fairness of the anchor in each time zone in the top list, in this embodiment, the start time, the end time, and the like related to the activity should be based on the local time zone time in each area, the time of the server cannot be uniformly used, and the local time zone time of each anchor should be used. Therefore, in this embodiment, when calculating the time difference between the time information and the task start time, the time information may be converted first, and in detail, referring to fig. 7, the following method may be implemented:
step S13221, for each user, obtaining a local time zone of the area where the user is located.
Step S13222, obtaining a reference time zone adopted by the live broadcast platform.
Step S13223, converting the obtained time information into time information in the local time zone according to the reference time zone and the local time zone.
Step S13224, calculating a time difference between the converted time information and the task start time.
For each anchor on the live platform, the local time zone of the area where the anchor is located may be obtained, e.g., the local time zone of the anchor is UTC +8 or UTC + 7. The live broadcast platform is provided with a reference time zone, namely the server time is the time in the reference time zone, and the time information of each anchor is marked by taking the reference time zone as a standard. The local time zones are the two anchor of UTC +8 and UTC +7 and the time marked on the server will differ by one hour even if the triggered time points are the same time of the same day.
Therefore, for each anchor, the time information of the anchor can be converted into the time information in the local time zone of the anchor according to the local time zone of the anchor and the reference time zone of the live platform. For example, the local time zones are two same time points of UTC +8 and UTC +7, the originally marked time information on the live broadcast platform may differ by one hour, and after both are converted into the time information of the local time zones, the same time points in the local time zones can be obtained.
Therefore, for the user side, the time consistency fairness can be achieved, and the ranking fairness of the anchor on the live list is guaranteed.
In this embodiment, since a plurality of types of live-broadcast lists are generated on the live-broadcast platform, a list ID may be set for each live-broadcast list, and the list ID may uniquely identify the live-broadcast list. And each user on the live broadcast platform has a user identifier, and the user identifier can be used for uniquely identifying each user.
In this embodiment, when implementing ranking of the list values, the list values of the multiple users may be written into the score fields in the data structure, and the user identifiers corresponding to the list values may be written into the member fields in the data structure. The data structure may be a zset data structure in redis.
And sequencing all users according to a preset sequencing rule in a data structure based on the score field and the member field, and generating a live list corresponding to the task to be created according to the sequencing results of the score field and the member field.
In this embodiment, the user identifier may be used to identify each user, and the user identifier is written into the zset data structure, and under the condition that the list values are the same, because the same user identifier does not exist on the live broadcast platform, ranking may also be achieved based on the user identifier, so as to ensure that the situation that ranking is difficult to separate does not occur.
As can be seen from the above, the generation of the live list is generated based on the statistical results over a period of time, during which the list values may undergo multiple rounds of updating. Therefore, when the live list corresponding to the task to be created is generated based on the sorted list numerical values, the method can be realized by the following steps:
and responding to an instruction for indicating the generation of the live list, and acquiring a sequencing result obtained based on the current latest list numerical value. And generating a live list corresponding to the task to be created according to the current sequencing result and the current latest list numerical value.
The instruction can be sent by an operator of the live broadcast platform to indicate that a corresponding live broadcast list is generated. In the case of receiving the instruction, the current ranking result should be ranked with the latest respective ranking value. That is, for example, the total score data of each anchor is counted from 2021-04-0110: 00:00, the total score data is accumulated, time information when each total score data arrives is recorded, and the list value is updated many times in the above manner. Upon receiving an instruction indicating generation of a master playbill at 2021-04-1010: 00:00, a ranking result of the current latest playbill value is obtained. And generating a live list based on the sequencing result and the current latest list numerical value. For example, a portion of the score term in the list value may be intercepted, and the live list may be generated and displayed in the order of the ranking results.
In order to further explain a scheme of the live chart generation method provided by the present embodiment, the present embodiment is described with reference to the following example.
In this embodiment, the items of detail data obtained during the event may be as shown in fig. 1, including a cast ID, a cast rank, a time zone, a diamond point, time information, and the like. After the obtained multiple items of detail data are processed according to the processing mode, the finally obtained list numerical value is formed by sequentially splicing an integral term, a carry-preventing term, a time term and a grade term, and the list numerical value can be a numerical value containing decimal places and integer places.
For example, the integral term may be a numerical value including an integer part and a decimal part that is accurate to one digit after the decimal point, and the carry-preventing term may occupy 1 digit, such as the 2 nd digit after the decimal point. The time entry may occupy more bits, for example, 7 bits, i.e., 3 rd to 9 th bits after the decimal point. The rank entry may occupy 1 bit, i.e., may occupy the 10 th bit after the decimal point. The resulting list value may be represented, for example, as 18.0041907041, where 18.0 represents an integral term, followed by 0 representing a carry-out prevention term set to 0, 4190704 represents a time term, followed by 1 representing a ranking term.
In this way, the multidimensional detail data of the user can be comprehensively embodied by using one digitized list numerical value, and the score term, the time term and the grade term are sequentially arranged in the list numerical value according to a sorting rule, namely the size sorting of the list numerical value is determined by the score term firstly, the time term is determined when the score terms are the same, and the grade term is determined when the score terms and the time terms are the same. Thus, ranking of the lists from multi-dimensional consideration can be realized only by ranking based on the size of the list numerical values.
In this embodiment, the zset data structure is used to realize the automatic ranking of the list values, a zincrby command of single-thread processing capability characteristic of redis and an evalsha command are used to provide lua script batch processing data and run processing commands, and the implementation may be realized, for example, as follows:
Figure BDA0003076476470000171
Figure BDA0003076476470000181
redis can adopt a single-thread batch processing command script, for the integral terms in the list numerical values, the integral terms are added by self through a 'zincrby' command by utilizing the computing power of Redis, and the carry term is prevented from being prevented, so that the integral term error caused by carry can be avoided. And for the time items and the grade items, splicing the obtained time items and the grade items sequentially through the script splicing capability. Thus, a latest list value is obtained.
For example, assume that the task start time is 2021-04-0110: 00:00, and the time of live broadcast A in its local time zone 2021-04-1010: 00:00 in the area where it is located is harvested to 10.5 diamond gift points (point data). The task start time may be converted into time information of the time zone where the live broadcast a is located, the converted task start time stamp is startTime 1617242400000, and the timestamp of the received diamond gift converted into the local time zone is createTime 1618020000000. The time difference between the time stamp of the received diamond gift and the task start time stamp is (createTime-startTime)/1000 is 777600 seconds.
Since the task start time startTime is a fixed value, according to the list rule, the larger the createTime is, the later the anchor of the same integral term on the list should be ranked, and therefore, the (createTime-startTime)/1000 cannot be directly used as the time term to be spliced in the list numerical value here, because the larger the createTime is, the later the theory is.
In this embodiment, the obtained time difference may be converted to obtain an updated time item, and the obtained updated time item is tail 3416704. The time is converted into a unified 7-bit effective numerical value through bit operation processing of 13-bit data of local timestamps of different time zones, and the time sequence of different time zones is sensed through the number.
In this embodiment, converting the time difference into tail may be performed according to the following formula:
longtail=(1<<22)-(((createTime-startTime)/1000)&((1<<22)-1))
wherein 1< <22 is a numerical value which can be set according to actual conditions, and here, a 22-bit binary numerical value is represented. The setting can be carried out according to the task planning time length, for example, 1< <22 can basically support the activity time span of about 50 days, 1< <21 can support the activity time span of about 25 days, and 1< <23 can support the activity time span of about 100 days. (createTime-startTime)/1000 represents a time difference (seconds) between the current distance task start time.
Referring to fig. 8, step 1 shows that the time difference between the task start timestamp and the current timestamp is calculated as 777600, and the time difference is converted into a binary number 10111101110110000000. Step 2 represents subtracting 1 from the above set converted binary number 1000000000000000000000 to obtain 1111111111111111111111. Step 3 represents the subtraction of the time difference to obtain 0010111101110110000000. The purpose of the step is mainly to solve the problem that the task span length exceeds the value outside the range of 50 days, and ignore the value of the high order by means of remainder. And step 4, calculating a difference value by using the result obtained by (1< <22) and the remainder, converting the difference value into a decimal number, and obtaining the tail-3416704.
By the mode, the larger time difference of the current time in the task span can be converted into a smaller value, and a 7-bit effective value is guaranteed to be output uniformly.
In this embodiment, the currently obtained diamond point is characterized as statValue of 10.5, and point data representing the obtained diamond gift is associated with anchor a, and a list ID and a user identifier in a data structure are also associated with anchor a, which can be written into a key1 field and a key2 field in the data structure, respectively.
First, the "zincrby" command is used to self-increment the statValue, if the original integral term is 10 integrals (the list value of the previous round in the data structure is 10.0012137041), the added value may become similar currentVal 20.5122337241 due to the problem of the double addition calculation accuracy of redis. In the chart numerical value in the embodiment, the carry-preventing term is spliced behind the integral term, so that the accuracy of the first digit behind the decimal point is not influenced by the number of digits behind the decimal point due to the 1-in problem, and the sum of the number of digits becomes 20.5 integral.
And then, the obtained time item tail and the anchor grade cover the original integral item and the anchor grade to be spliced into an updated integral item, the obtained updated list numerical value is newVal which is 20.5034167041 (the integral item is 20.5+ the carry prevention item is 0+ the time item is 3416704+ the anchor grade is 1), the updated list numerical value is written into a data structure, and the sorting of the plurality of list numerical values is realized through the automatic sorting function of the data structure.
Compared with the existing processing mode, the live-broadcast list generation scheme provided by the embodiment needs a large amount of computing resource responses to realize list statistics and rule output display data. According to the scheme, the multidimensional detail data are spliced into the one-dimensional numerical value, so that the list ranking business requirements of live broadcast in a plurality of different time zones can be met with low storage cost. For example, in the existing processing mode, db meets the request amount of 1Wtps, and db may need to use 5 32 core standby libraries, so that the scheme can be implemented only by using one single-node 8-core redis resource.
In addition, in the existing processing mode, in order to realize the list requirement with time sequence, corresponding db storage and query logic need to be specially designed, and the scheme directly splices and writes in one-dimensional list numerical values through a unified development mode, so that the sequenced results can be directly obtained without complex query logic. In addition, the scheme can be compatible with the mode for acquiring the detailed data in the original processing mode, and the cost is hardly required to be improved.
In the embodiment, the complex list rule multidimensional information is converted into the one-dimensional list numerical value storage data structure, combination of a plurality of fields of the data structure is not needed, and normal business development requirements can be met. Moreover, the maintenance cost of a calculation engine of the platform can be reduced, and the technical scheme of the activity list is unified through the unified data storage output capability of the bottom layer and the data processing calculation.
In addition, in the embodiment, the time information is converted into the time items meeting the list rule, so that the ranking of the anchor can be accurately realized by using the size of the time items. In addition, in this embodiment, it is also considered that, when the live broadcast platform is applied in a global scenario, because the problem of time zone differences in a plurality of different time zones is involved, time information is converted into local time zones in various regions, and the time points in the respective local time zones are used for sorting, so that fair consistency of the list to the anchor broadcast in each time zone is ensured.
Referring to fig. 9, an electronic device, which may be the live broadcast server 100 described above, is further provided in an embodiment of the present application.
In detail, the electronic device may include a memory 410, a processor 420, and a live listing generation apparatus 430. The memory 410 and the processor 420 are electrically connected directly or indirectly to enable data transfer or interaction. For example, they may be electrically connected to each other via one or more communication buses or signal lines. The live chart generating device 430 includes at least one software function module that can be stored in the memory 410 in the form of software or firmware (firmware). The processor 420 is configured to execute an executable computer program stored in the memory 410, for example, a software function module and a computer program included in the live chart generating apparatus 430, so as to generate a live chart, reduce query complexity on the basis of reducing cost, and achieve the purposes of improving processing efficiency and corresponding to a high concurrent request amount.
The Memory 410 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like. The memory 410 is used for storing programs, and the processor 420 executes the programs after receiving execution instructions.
The processor 420 may be an integrated circuit chip having signal processing capabilities. For example, the System may be a Central Processing Unit (CPU), a Network Processor (NP), a System on Chip (SoC), a Digital Signal Processor (DSP), etc. to implement or execute the methods and steps disclosed in the embodiments of the present application.
It will be appreciated that the configuration shown in fig. 9 is merely illustrative, and that the electronic device may also include more or fewer components than shown in fig. 9, or have a different configuration than shown in fig. 9, for example, and may also include a communication unit for information interaction with other live devices. Wherein the components shown in fig. 9 may be implemented in hardware, software, or a combination thereof.
Referring to fig. 10, a functional module block diagram of a live list generating device 430 according to an embodiment of the present application is shown. The live list generating apparatus 430 includes a first obtaining module 431, a second obtaining module 432, a splicing module 433, and a generating module 434.
The first obtaining module 431 is configured to obtain configuration information of a task to be created.
In this embodiment, the first obtaining module 431 may be configured to perform step S110 shown in fig. 3, and reference may be made to the foregoing description of step S110 for relevant contents of the first obtaining module 431.
A second obtaining module 432, configured to obtain multiple items of detailed data of multiple users on the live broadcast platform according to the configuration information.
In this embodiment, the second obtaining module 432 may be configured to perform step S120 shown in fig. 3, and reference may be made to the foregoing description of step S120 for relevant contents of the second obtaining module 432.
The splicing module 433 is configured to splice the multiple detailed data of each user according to a preset splicing rule to obtain a list numerical value;
in this embodiment, the splicing module 433 may be configured to perform step S130 shown in fig. 3, and reference may be made to the foregoing description of step S130 for relevant contents of the splicing module 433.
The generating module 434 is configured to sort the list values of the multiple users according to a preset sorting rule, and generate a live list corresponding to the task to be created based on the sorted list values.
In this embodiment, the generating module 434 may be configured to execute step S140 shown in fig. 3, and reference may be made to the foregoing description of step S140 for relevant contents of the generating module 434.
In a possible implementation manner, the detail data includes integral data and time information when obtaining the integral data, and the splicing module 433 is specifically configured to:
for each user, updating the score items contained in the list numerical value obtained in the previous round according to the acquired score data;
obtaining an updated time item according to the acquired time information;
covering the time item in the updated ranking list numerical value of the integral item by using the updated time item to obtain the ranking list numerical value of the round, wherein the integral item and the time item in the ranking list numerical value are sequentially arranged and spliced.
In a possible implementation manner, the splicing module 433 may be specifically configured to obtain the updated time item by:
acquiring task starting time of a task to be created;
calculating a time difference between the obtained time information and the task start time;
and converting the time difference to obtain an updated time item, wherein the smaller the time difference is, the larger the updated time item obtained after conversion is.
In a possible implementation manner, the splicing module 433 may be specifically configured to:
setting a conversion binary number according to the task plan time length of the task to be created;
converting the time difference based on the converted binary number to generate a binary time difference of the same number of bits as the converted binary number;
and performing decimal conversion on the binary time difference to obtain an updated time item.
In a possible implementation manner, the splicing module 433 may be specifically configured to obtain the time difference by:
for each user, obtaining a local time zone of the area where the user is located;
obtaining a reference time zone adopted by the live broadcast platform;
converting the obtained time information into the time information in the local time zone according to the reference time zone and the local time zone;
calculating a time difference between the converted time information and the task start time.
In a possible implementation manner, a carry-prevention term is further spliced between the integral term and the time term in the list numerical value, and the carry-prevention term is reset to be between [0,8] after each round of updating of the integral term is completed.
In a possible implementation manner, a ranking item is further spliced after the time item in the list numerical value, and the ranking is higher as the numerical value of the ranking item is larger.
In a possible implementation manner, the generating module 434 may specifically be configured to:
writing the list numerical values of the users into a score field in a data structure, and writing the user identification corresponding to each list numerical value into a member field in the data structure;
sorting each user according to a preset sorting rule in the data structure based on the score field and the member field;
and generating a live list corresponding to the task to be created according to the sorting results of the score field and the member field.
In a possible implementation manner, the generating module 434 may specifically be configured to:
responding to an instruction for indicating generation of a live list, and acquiring a sequencing result obtained based on the current latest list numerical value;
and generating a live list corresponding to the task to be created according to the current sequencing result and the current latest list numerical value.
The description of the processing flow of each module in the device and the interaction flow between the modules may refer to the related description in the above method embodiments, and will not be described in detail here.
In an embodiment of the present application, a computer-readable storage medium is provided, where a computer program is stored in the computer-readable storage medium, and the computer program executes each step of the live chart generating method when running.
In this embodiment, the steps executed when the computer program runs are not described in detail, and the explanation of the live chart generation method may be referred to in the foregoing.
To sum up, the live list generation method, the device, the electronic device, and the readable storage medium provided in the embodiment of the present application acquire the respective multiple items of detail data of the multiple users on the live platform based on the configuration information of the task to be created, splice the multiple items of detail data according to the preset splicing rule to obtain the list numerical values, sort the list numerical values of the multiple users according to the preset sorting rule, and generate the corresponding live list based on the sorted list numerical values. According to the scheme, the plurality of items of detailed data are spliced into the list numerical values, sorting is performed based on the list numerical values, sorting is directly achieved through the one-dimensional list numerical values, data under a plurality of fields in the SQL database are not needed to be combined for sorting, on the basis of reducing storage cost, the complexity of query is reduced, and the purposes of improving processing efficiency and coping with high concurrency request quantity are achieved.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (12)

1. A method for generating a live list, the method comprising:
acquiring configuration information of a task to be created;
acquiring respective multiple items of detail data of multiple users on a live broadcast platform according to the configuration information;
splicing the multiple items of detail data of each user according to a preset splicing rule to obtain a list numerical value;
ranking the list numerical values of the users according to a preset ranking rule, and generating the live list corresponding to the task to be created based on the ranked list numerical values.
2. The live chart generation method according to claim 1, wherein the detail data includes point data and time information when the point data is obtained;
the step of splicing the multiple detailed data of each user according to a preset splicing rule to obtain a list numerical value comprises the following steps:
for each user, updating the score items contained in the list numerical value obtained in the previous round according to the acquired score data;
obtaining an updated time item according to the acquired time information;
covering the time item in the updated ranking list numerical value of the integral item by using the updated time item to obtain the ranking list numerical value of the round, wherein the integral item and the time item in the ranking list numerical value are sequentially arranged and spliced.
3. The method of generating a live chart according to claim 2, wherein the step of obtaining an updated time item according to the obtained time information includes:
acquiring task starting time of a task to be created;
calculating a time difference between the obtained time information and the task start time;
and converting the time difference to obtain an updated time item, wherein the smaller the time difference is, the larger the updated time item obtained after conversion is.
4. The method of generating a live chart according to claim 3, wherein the step of converting the time difference to obtain an updated time item comprises:
setting a conversion binary number according to the task plan time length of the task to be created;
converting the time difference based on the converted binary number to generate a binary time difference of the same number of bits as the converted binary number;
and performing decimal conversion on the binary time difference to obtain an updated time item.
5. The method of generating a live chart according to claim 3, wherein the step of calculating a time difference between the obtained time information and the task start time comprises:
for each user, obtaining a local time zone of the area where the user is located;
obtaining a reference time zone adopted by the live broadcast platform;
converting the obtained time information into the time information in the local time zone according to the reference time zone and the local time zone;
calculating a time difference between the converted time information and the task start time.
6. The live chart generation method according to claim 2, characterized in that a carry prevention term is further spliced between the score term and the time term in the chart numerical value, and the carry prevention term is reset to [0,8] after each round of updating of the score term.
7. The live stock listing generation method according to claim 6, wherein ranking items are further spliced after the time item in the listing numerical values, and the ranking items are ranked higher as the numerical values of the ranking items are larger.
8. The live chart generation method according to claim 1, wherein the step of ranking the chart values of the plurality of users according to a preset ranking rule and generating the live chart corresponding to the task to be created based on the ranked chart values includes:
writing the list numerical values of the users into a score field in a data structure, and writing the user identification corresponding to each list numerical value into a member field in the data structure;
sorting each user according to a preset sorting rule in the data structure based on the score field and the member field;
and generating a live list corresponding to the task to be created according to the sorting results of the score field and the member field.
9. The live chart generation method according to claim 2, wherein the step of generating the live chart corresponding to the task to be created based on the sorted chart numerical values includes:
responding to an instruction for indicating generation of a live list, and acquiring a sequencing result obtained based on the current latest list numerical value;
and generating a live list corresponding to the task to be created according to the current sequencing result and the current latest list numerical value.
10. An apparatus for generating a live list, the apparatus comprising:
the first acquisition module is used for acquiring the configuration information of the task to be created;
the second acquisition module is used for acquiring various detailed data of a plurality of users on the live broadcast platform according to the configuration information;
the splicing module is used for splicing the multiple detailed data of each user according to a preset splicing rule to obtain a list numerical value;
the generating module is used for sequencing the list numerical values of the users according to a preset sequencing rule and generating the live list corresponding to the task to be created based on the sequenced list numerical values.
11. An electronic device comprising one or more storage media and one or more processors in communication with the storage media, the one or more storage media storing processor-executable machine-executable instructions that, when executed by the electronic device, are executed by the processors to perform the method steps of any of claims 1-9.
12. A computer-readable storage medium, characterized in that it stores machine-executable instructions which, when executed, implement the method steps of any one of claims 1-9.
CN202110554015.2A 2021-05-20 2021-05-20 Live list generation method and device, electronic equipment and readable storage medium Pending CN113194339A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110554015.2A CN113194339A (en) 2021-05-20 2021-05-20 Live list generation method and device, electronic equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110554015.2A CN113194339A (en) 2021-05-20 2021-05-20 Live list generation method and device, electronic equipment and readable storage medium

Publications (1)

Publication Number Publication Date
CN113194339A true CN113194339A (en) 2021-07-30

Family

ID=76982787

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110554015.2A Pending CN113194339A (en) 2021-05-20 2021-05-20 Live list generation method and device, electronic equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN113194339A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113742581A (en) * 2021-08-23 2021-12-03 北京百度网讯科技有限公司 List generation method and device, electronic equipment and readable storage medium
CN113992930A (en) * 2021-10-28 2022-01-28 广州方硅信息技术有限公司 Virtual resource conversion method and device, live broadcast system, equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102231860A (en) * 2011-06-03 2011-11-02 南京远古科技有限公司 Live time shift data storage method
US20140122494A1 (en) * 2012-10-31 2014-05-01 Mapmyfitness, Inc. System and method for personal and peer performance ranking of outdoor activities
CN110611826A (en) * 2019-10-15 2019-12-24 广州虎牙科技有限公司 List generation method and device, server and readable storage medium
CN111913977A (en) * 2020-08-19 2020-11-10 上海莉莉丝网络科技有限公司 Data processing method, device and medium
CN112015732A (en) * 2020-07-31 2020-12-01 北京奇艺世纪科技有限公司 Sorting method, sorting device, electronic equipment and storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102231860A (en) * 2011-06-03 2011-11-02 南京远古科技有限公司 Live time shift data storage method
US20140122494A1 (en) * 2012-10-31 2014-05-01 Mapmyfitness, Inc. System and method for personal and peer performance ranking of outdoor activities
CN110611826A (en) * 2019-10-15 2019-12-24 广州虎牙科技有限公司 List generation method and device, server and readable storage medium
CN112015732A (en) * 2020-07-31 2020-12-01 北京奇艺世纪科技有限公司 Sorting method, sorting device, electronic equipment and storage medium
CN111913977A (en) * 2020-08-19 2020-11-10 上海莉莉丝网络科技有限公司 Data processing method, device and medium

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113742581A (en) * 2021-08-23 2021-12-03 北京百度网讯科技有限公司 List generation method and device, electronic equipment and readable storage medium
CN113742581B (en) * 2021-08-23 2023-09-12 北京百度网讯科技有限公司 Method and device for generating list, electronic equipment and readable storage medium
CN113992930A (en) * 2021-10-28 2022-01-28 广州方硅信息技术有限公司 Virtual resource conversion method and device, live broadcast system, equipment and storage medium
CN113992930B (en) * 2021-10-28 2023-10-03 广州方硅信息技术有限公司 Virtual resource conversion method, device, live broadcast system, equipment and storage medium

Similar Documents

Publication Publication Date Title
CN108776934B (en) Distributed data calculation method and device, computer equipment and readable storage medium
CN110795455B (en) Dependency analysis method, electronic device, computer apparatus, and readable storage medium
CN112000675B (en) Quotation data updating method and device, terminal equipment and storage medium
CN107578287B (en) Frequency control method and device for advertisement putting
CN113194339A (en) Live list generation method and device, electronic equipment and readable storage medium
CN110704677A (en) Program recommendation method and device, readable storage medium and terminal equipment
CN114070791B (en) Speed limiting processing method and device for data traffic
CN109544207A (en) A kind of information processing method, storage medium and server
CN113076231A (en) Server application scene setting method, system, terminal and storage medium
CN111050217B (en) Video playing method and device
CN113760242A (en) Data processing method, device, server and medium
CN112487018A (en) List generation method, apparatus electronic device and computer readable storage medium
CN111488382A (en) Data calling method and system and electronic equipment
CN111311310A (en) Advertisement order pushing method and device, storage medium and electronic device
CN112491939B (en) Multimedia resource scheduling method and system
CN111291127B (en) Data synchronization method, device, server and storage medium
CN108900922B (en) Method and device for setting label of live broadcast component
CN110223108B (en) Click through rate prediction method, device and equipment
CN109033469B (en) Ranking method and device of search results, terminal and computer storage medium
CN111800211B (en) Data processing method, device and system
CN112162820A (en) Timing method and device of timer
CN115269160B (en) Timed task execution method, device and system
CN117972096B (en) Method and system for processing interaction message of social platform
CN111368207B (en) Data processing method and system, candidate data pool, electronic device and computer readable storage medium
CN111522993B (en) Tag validity management method, device, network equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20210730

RJ01 Rejection of invention patent application after publication