CN111372089B - Method, device and storage medium for updating activity list - Google Patents
Method, device and storage medium for updating activity list Download PDFInfo
- Publication number
- CN111372089B CN111372089B CN202010093424.2A CN202010093424A CN111372089B CN 111372089 B CN111372089 B CN 111372089B CN 202010093424 A CN202010093424 A CN 202010093424A CN 111372089 B CN111372089 B CN 111372089B
- Authority
- CN
- China
- Prior art keywords
- activity
- message
- user
- period
- list
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/21—Server components or server architectures
- H04N21/218—Source of audio or video content, e.g. local disk arrays
- H04N21/2187—Live feed
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management 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/254—Management at additional data server, e.g. shopping server, rights management server
- H04N21/2543—Billing, e.g. for subscription services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management 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/262—Content 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/26291—Content 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/47—End-user applications
- H04N21/478—Supplemental services, e.g. displaying phone caller identification, shopping application
- H04N21/4788—Supplemental services, e.g. displaying phone caller identification, shopping application communicating with other users, e.g. chatting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application discloses a method, a device and a storage medium for updating a activity list, and belongs to the technical field of internet. In the embodiment of the application, the activity list in the first activity period can be updated according to the first message, and then the global list in the current activity period can be updated according to the second message. Because the global list contains the user data carried by all the messages belonging to the current activity time period, even if the first message is delayed, the correct activity list of the current activity time period can still be obtained according to the updated global list and the updated list of the first activity time period, and the problem that the activity list of the current activity time period is wrong due to promoted user errors caused by message delay is solved.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a method, an apparatus, and a storage medium for updating a chart.
Background
Currently, to enhance the user experience and increase the user's viscosity, application providers may set various activities in applications. For example, in a live broadcast application, an application facilitator may set a popularity anchor competition activity, generate an anchor list by counting the value or number of gifts received by the anchor within a fixed time period, and then evaluate the popularity anchor from the anchor list. In activities such as this, the activity may generally be divided into a plurality of activity periods, and during each activity period, the activity data for that period may be counted to generate a list of activities for that period, and then based on the list of activities for that period, the user promoted to the next period may be determined.
In the related art, for any activity period, at a certain specified time after the activity period ends, a final activity list of the corresponding activity period is generated according to activity messages belonging to the activity period and processed up to the specified time, and then the top N users are selected from the final activity list to promote to the next activity period. Wherein the activity message carries activity data. Thereafter, in a next activity period, the leaderboard for the next activity period may be updated based on the activity message including the activity data of the user of the promotion.
However, in some cases, the activity message belonging to a certain activity period may be delayed for various reasons, so that when a specified time arrives, a part of the activity message belonging to the activity period may not be processed in time, which may cause inaccuracy of the generated final activity list of the activity period, and based on this, the user who is determined according to the final activity list and proceeds to the next activity period may also have errors, thereby causing errors of the activity list of the next activity period updated according to the user who is determined according to the final activity list.
Disclosure of Invention
The embodiment of the application provides a method, a device and a storage medium for updating a activity list, which can be used for improving the accuracy of the activity list. The technical scheme is as follows:
in a first aspect, a method for updating a leaderboard is provided, the method comprising:
acquiring a first message, wherein the first message is an activity message belonging to a first activity period, and the first activity period is a last activity period of a current activity period;
updating the activity list of the first activity period according to the first message;
acquiring a second message, wherein the second message is an activity message belonging to the current activity period;
updating a global list of the current activity time period according to the second message, wherein the global list comprises user data carried by all messages belonging to the current activity time period;
and updating the activity list in the current activity time period according to the updated global list in the current activity time period and the updated list in the first activity time period.
Optionally, the second message carries user data of a second user, where the user data includes a user identifier and activity data;
the updating the global list of the current activity period according to the second message includes:
if the user identifier of the second user carried by the second message exists in the global list, updating activity data corresponding to the user identifier of the second user in the global list according to the activity data of the second user carried by the second message.
Optionally, the method further comprises:
and if the user identifier of the second user carried by the second message does not exist in the global list, adding the user data of the second user in the global list.
Optionally, the leaderboard includes user data of a plurality of users, the user data including user identifications and activity data;
the updating the activity list in the current activity time period according to the updated global list in the current activity time period and the updated list in the first activity time period includes:
acquiring user identifiers with corresponding activity data ranked at the top N from the updated activity list of the first activity time period to obtain N promotion user identifiers, wherein N is an integer larger than 0;
determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period;
generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications;
and taking the temporary list of the current activity time period as the activity list of the current activity time period.
Optionally, the determining, according to the updated global list of the current activity period, target activity data corresponding to the N promotion user identifiers includes:
searching each promotion user identification from the updated global list;
for the searched promotion user identification, obtaining activity data corresponding to the searched promotion user identification from the updated global list, and taking the obtained activity data as target activity data corresponding to the corresponding promotion user identification;
and for the searched promotion user identification, setting the target activity data corresponding to the searched promotion user identification as 0.
Optionally, the first message carries a timestamp of the first message, the second message carries a timestamp of the second message, and the timestamp is used to indicate a generation time of the corresponding message, or the timestamp is used to indicate a completion time of an operation corresponding to the corresponding message.
Optionally, the first message and the second message are both located in a message queue, and the first message is located before the second message, where the message queue includes a plurality of messages, and the plurality of messages are arranged according to the receiving time sequence of the plurality of messages, or the plurality of messages are arranged according to the weight of the plurality of messages.
In a second aspect, an apparatus for updating a leaderboard is provided, the apparatus comprising:
a first obtaining module, configured to obtain a first message, where the first message is an activity message belonging to a first activity period, and the first activity period is a previous activity period of a current activity period;
the first updating module is used for updating the activity list of the first activity time period according to the first message;
a second obtaining module, configured to obtain a second message, where the second message is an activity message belonging to the current activity period;
the second updating module is further configured to update the global list in the current activity period according to the second message, where the global list includes user data carried by all messages belonging to the current activity period;
the second updating module is further configured to update the activity list in the current activity period according to the updated global list in the current activity period and the updated list in the first activity period.
Optionally, the second message carries user data of a second user, where the user data includes a user identifier and activity data;
the second update module is specifically configured to:
if the user identifier of the second user carried by the second message exists in the global list, updating activity data corresponding to the user identifier of the second user in the global list according to the activity data of the second user carried by the second message.
Optionally, the second updating module is further specifically configured to:
and if the user identifier of the second user carried by the second message does not exist in the global list, adding the user data of the second user in the global list.
Optionally, the leaderboard includes user data of a plurality of users, the user data including user identifications and activity data;
the third updating module is specifically configured to:
acquiring user identifiers with corresponding activity data ranked at the top N from the updated activity list of the first activity time period to obtain N promotion user identifiers, wherein N is an integer larger than 0;
determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period;
generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications;
and taking the temporary list of the current activity time period as the activity list of the current activity time period.
Optionally, the third updating module is specifically configured to:
searching each promotion user identification from the updated global list;
for the searched promotion user identification, obtaining activity data corresponding to the searched promotion user identification from the updated global list, and taking the obtained activity data as target activity data corresponding to the corresponding promotion user identification;
and for the searched promotion user identification, setting the target activity data corresponding to the searched promotion user identification as 0.
Optionally, the first message carries a timestamp of the first message, the second message carries a timestamp of the second message, and the timestamp is used to indicate a generation time of the corresponding message, or the timestamp is used to indicate a completion time of an operation corresponding to the corresponding message.
Optionally, the first message and the second message are both located in a message queue, and the first message is located before the second message, where the message queue includes a plurality of messages, and the plurality of messages are arranged according to the receiving time sequence of the plurality of messages, or the plurality of messages are arranged according to the weight of the plurality of messages.
In a third aspect, an apparatus for updating a leaderboard is provided, the apparatus comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor executes executable instructions in the memory to perform any of the methods of the first aspect.
In a fourth aspect, a computer-readable storage medium is provided, having instructions stored thereon, which when executed by a processor, implement the steps of any of the methods of the first aspect described above.
The beneficial effects brought by the technical scheme provided by the embodiment of the application at least comprise:
in the embodiment of the application, the activity list in the first activity period can be updated according to the first message, and then the global list in the current activity period can be updated according to the second message. Because the global list contains the user data carried by all the messages belonging to the current activity time period, even if the first message is delayed, the correct activity list of the current activity time period can still be obtained according to the updated global list and the updated list of the first activity time period, and the problem that the activity list of the current activity time period is wrong due to promoted user errors caused by message delay is solved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a system architecture diagram of a network system according to an embodiment of the present application;
fig. 2 is a flowchart of a method for updating a leader board according to an embodiment of the present application;
fig. 3 is a schematic diagram of a message queue provided in an embodiment of the present application;
FIG. 4 is a schematic diagram of a leader board of the S1 period before processing the message A in the message queue of FIG. 3 according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a leader board of the S1 period after processing the message A in the message queue of FIG. 3 according to an embodiment of the present application;
FIG. 6 is a schematic diagram of a leader board of the S1 period after processing the message C in the message queue of FIG. 3 according to an embodiment of the present application;
FIG. 7 is a schematic diagram of a leader board of the S2 period before processing the message D in the message queue of FIG. 3 by a method provided by an embodiment of the present application;
FIG. 8 is a schematic diagram of a leader board at the time period S2 after processing the message D in the message queue of FIG. 3 by a method provided by an embodiment of the present application;
fig. 9 is a schematic structural diagram of an apparatus for updating a leaderboard provided by an embodiment of the present application;
fig. 10 is a schematic structural diagram of a server for updating a leaderboard provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
Before explaining the embodiments of the present application in detail, an application scenario related to the embodiments of the present application will be described.
Currently, in various applications such as games, live broadcasts, music, and the like, various activities may be set in the applications in order to increase user stickiness and improve application revenues. In the activity, a list of the activity in the corresponding period can be generated according to the user data in different activity periods, and then a promotion user from the promotion to the next activity period is selected, so that the enthusiasm of the user for making a best lead is provided.
For example, in a gaming application, a ranking reward activity may be set, and for a first activity period, a list for the first activity period may be generated based on data from all users participating in the activity completing a game task within the first activity period, assuming the activity may be divided into three activity periods. Thereafter, a top N user promotions are selected from the list for the first campaign period to a second campaign period. In the second activity period, a chart of the second activity period may be obtained based on the data of the N users of the promotional level completing the game task in the second activity period. And continuously selecting M users from the N promoting users in the activity list in the second activity period as the promoting users in the third activity period, and finally obtaining the final list of the activity according to the data of the M users completing the game task in the third activity period so as to reward the users in the final list.
As another example, in a live application, a main play event may be set. It is assumed that the activity can be divided into three activity periods. For the first activity period, all the anchor participating in the activity can perform talent demonstration according to the requirements of the first activity period. Audience users can give gifts to the anchor according to talent shows of the respective anchors. And counting the total value of the gifts received by each anchor in the first activity time period, and generating the activity list in the first activity time period according to the descending order of the total value of the gifts. And taking the top N anchor in the chart of the first activity period as the anchor promoted to the second activity period. Later, in the second activity period, the N-bit anchor can perform different talent demonstration according to the requirements of the second activity period. And counting the total value of the gifts received by the N anchor players in the second activity period, and further generating a campaign list of the second activity period. And taking the top M numbered anchor in the chart of the second activity period as the anchor of the promotion to the third activity period. And finally, obtaining a final list according to the total value of the gifts received by the N anchor broadcasters in the third activity period, and further evaluating and selecting the optimal anchor according to the final list.
The method for updating the activity list provided by the embodiment of the application can be applied to the activity process, and is used for updating the activity lists in different activity periods so as to ensure the accuracy of the activity lists.
It should be noted that the foregoing is only an example of several possible application scenarios given in the embodiment of the present application, but does not constitute a limitation on the application scenarios in the embodiment of the present application.
Next, a system configuration according to an embodiment of the present application will be described.
Fig. 1 is a schematic diagram of a network system according to an embodiment of the present application. As shown in fig. 1, the network system includes a user equipment 101, a first server 102, and a second server 103. Therein, the user equipment 101 may communicate with a first server 102, and the first server 102 may communicate with a second server 103.
The user device 101 may refer to a device corresponding to a user participating in an activity. The user device 101 may generate operation data according to a user operation, and then send the operation data to the first server 102.
It should be noted that the user equipment 101 may be different according to different application scenarios. For example, when the application scenario is the ranking reward activity in the aforementioned game application, the user equipment 101 may be the equipment of the user participating in the ranking, and at this time, the operation data sent by the user equipment 101 is the user data of the user corresponding to the user equipment, that is, the data of the user corresponding to the user equipment completing the game task and the user identifier of the user. For another example, when the application scene is the anchor competition activity in the live application, the user equipment 101 may be all devices of the audience users who give gifts to the respective anchors during the activity, and at this time, the operation data sent by the user equipment 101 is a giving request for giving gifts to the audience users.
The first server 102 may generate an activity message according to the operation data sent by each user equipment 101 after receiving the operation data sent by the user equipment 101. Wherein the activity message includes user data determined from the operational data.
Similarly, the method for generating the active message by the first server 102 is different according to different application scenarios. For example, in the game application scenario, after receiving the operation data sent by each user, the first server 102 may use the operation data sent by each user as the user data of each user, and further generate a corresponding activity message according to the user data of each user. For another example, in the scenario of the live broadcast application, after receiving the gifting request of each audience user for gifting the gift, the first server 102 may deduct the fee from the account of the corresponding audience user according to the gifting request of each audience user for gifting the gift to complete gifting of the gift, that is, complete processing of the gifting request. After the completion of the gifting request processing, the first server 102 may generate an activity message corresponding to the gifting request from the activity data, using the gift value in the corresponding gifting request as an activity data, where the activity message includes the activity data and the identification of the anchor.
Optionally, in other scenarios, the first server 102 may also generate activity messages of the users who subsequently participate in the list generation by other methods. The embodiments of the present application are not limited herein. When generating an activity message, the first server 102 may generate a timestamp of the corresponding activity message according to the generation time of the activity message or the completion time of the operation corresponding to the activity message, and carry the timestamp in the corresponding activity message. The completion time of the operation corresponding to the activity message may refer to the settlement time of the activity data in the activity message. For example, in the above-described live application scenario, the completion time of the operation corresponding to the activity message is the time of the activity data obtained by the settlement when the gifting operation corresponding to the activity message is completed.
The first server 102, after generating the activity message, may send the activity message to the second server 103. After receiving the activity message, the second server 103 may update the activity list according to the activity message according to the method provided in the embodiment of the present application.
It should be noted that the user equipment 101 may be a terminal device such as a smart phone, a notebook, a tablet, a desktop computer, or the like. The first server 102 and the second server 103 may be two independent servers, or may be two different functional modules included in one server. The embodiment of the present application does not limit this.
Next, a method for updating a leader board provided in an embodiment of the present application is described.
Fig. 2 is a method for updating a leader board according to an embodiment of the present application. The method may be applied in a server, for example, in a second server as shown in fig. 1. As shown in fig. 2, the method comprises the steps of:
step 201: the method comprises the steps of obtaining a first message, wherein the first message is an activity message belonging to a first activity period, and the first activity period is a last activity period of a current activity period.
In the embodiment of the present application, a message queue may be maintained in the server. A plurality of messages received by the server up to the current time and not yet processed may be included in the message queue. The server may process each message in sequence from front to back in the message queue. The plurality of messages may be arranged from front to back according to the receiving time sequence of the messages received by the server. Optionally, the plurality of messages may also be arranged from front to back according to the weight of each message. Alternatively, the plurality of messages may be ordered according to other rules. Wherein the weight of each message may be used to indicate the importance of each message.
In addition, in the embodiment of the present application, each message in the message queue carries a timestamp, and the timestamp may be used to indicate the generation time of the corresponding message or the completion time of the operation corresponding to the corresponding message. From the timestamp of each message, it can be determined to which activity period the message belongs. For example, assuming that the message A has a timestamp of 2019-12-12-23:30 and the first activity period is 18:00 to 24:00 of 2019-12-12, it may be determined that the message A belongs to the first activity period.
As can be seen from the above description, the arrangement of the messages in the message queue is not necessarily arranged according to the time stamps of the messages, so that a message with an earlier time stamp may be arranged after a message with a later time stamp. In this case, after the entry from the first activity period to the current activity period, there may be further messages belonging to the first activity period unprocessed. Based on this, the server may read a first message belonging to a first activity period from the message queue during a current activity period.
It should be noted that each activity message in each activity period carries user data of one user, and the user data may include a user identifier and activity data of a corresponding user. The User identifier may be used to uniquely identify a corresponding User, and may be, for example, a UID (User Identification). The activity data is data used for generating a list for the user to participate in the activity. For example, assume that in the scenario of the live application introduced above, the activity data may be the value of a gift.
Step 202: and updating the activity list of the first activity period according to the first message.
After the first message is acquired, the server may update the chart of the first activity period according to the first message.
The activity list of the first activity period is obtained by the server according to a plurality of activity messages which are processed before the current time and belong to the first activity period. User data for a plurality of users may be included within the leaderboard. The user data may include a user identifier and activity data corresponding to the user identifier. In the event list, the user data is arranged according to the size of the included event data.
As can be seen from the foregoing description in step 201, the activity message may carry the user identifier and the activity data. Based on this, after reading the first message, the server may search, from within the leaderboard of the first activity period, whether the user identifier of the first user carried by the first message exists. If the user identifier of the first user exists in the activity list in the first activity period, the server may update the activity data corresponding to the user identifier of the first user in the activity list according to the activity data carried in the first message.
For example, the server may add the activity data corresponding to the user identifier of the first user in the activity list to the activity data carried in the first message, so as to update the activity data corresponding to the user identifier of the first user in the activity list.
For example, in the above live broadcast application scenario, assuming that the active data corresponding to each user identifier in the active list is the total value of the gifts received by the anchor in the first active period so far, and the first message carries the total value of the gifts given by a certain audience user to the anchor, the server may add the total value of the gifts given this time to the total value of the gifts in the active list, so as to obtain an updated total value of the gifts, and replace the total value of the gifts in the active list in the first active period with the updated total value of the gifts.
Optionally, if activity data corresponding to the user identifier of the first user does not exist in the activity list in the first activity period, the server may determine whether the first activity period is a first activity period of the current activity, and if the first activity period is the first activity period of the current activity, the server may directly add the user data of the first user, which is carried in the first message, to the activity list in the first activity period.
When the user data of the first user is added into the chart of the first activity period, the server may determine, from the chart of the first activity period, two target activity data that are greater than each other, where the former target activity data is greater than the activity data included in the user data of the first user, and the latter target activity data is less than the activity data in the user data of the first user. The server may then add the user data of the first user to between the records where the two target activity data are located.
Optionally, if the first activity period is not the first activity period of the current activity, the server may not update the leaderboard for the first activity period according to the first message.
Step 203: and acquiring a second message, wherein the second message is an activity message belonging to the current activity period.
After updating the leaderboard of the first activity period according to the first message, the server may read a next message of the first message in the message queue and process the next message. In which case the next message may still be an activity message belonging to the first activity period, in which case the server may continue to update the chart for the first activity period according to this message in the foregoing implementation of step 202. Optionally, the next message may also be an active message belonging to the current activity period, i.e. the second message. In this case, the server may perform step 204.
Step 204: and updating the global list in the current activity time period according to the second message, wherein the global list comprises user data carried by all messages belonging to the current activity time period.
The second message is an activity message belonging to the current activity period. As can be seen from the foregoing description, the activity message carries the user identifier and the activity data. Based on this, the second message may carry the user identifier and the activity data of the second user. The second user may be the same user as the first user or a different user. If the user is the same user, the second message and the first message actually correspond to two operations of the user. Thus, the activity data in the first message and the second message may be the same or different.
In the embodiment of the application, in each activity period, the server may maintain a global list of the activity period. The global list includes user data carried by all messages belonging to the current activity period.
Taking the current activity period as an example, when the server processes the first activity message belonging to the current activity period from the time of entering the current activity period, the server may create a list of the current activity period according to the user data included in the message. Then, when an activity message belonging to the current activity period is processed, if the user identifier included in the activity message already exists in the global list, the activity data corresponding to the user identifier corresponding to the global list is updated according to the activity data included in the activity message, and if the user identifier included in the activity message does not exist in the global list, the server may add the user data carried in the activity message to the global list.
Based on this, after the server acquires the second message, it may be first determined whether a global list is created currently, and if the global list is not created, the global list may be created according to the second message, and at this time, the global list only includes user data of the second user carried by the second message. If the global list is created, the server can search whether the current global list contains the user identification of the second user. And if so, updating the activity data corresponding to the user identifier of the second user in the global list according to the activity data of the second user carried by the second message. In an implementation manner of updating the global list according to the activity data of the second user carried by the second message, reference may be made to the manner of updating the activity list in the first activity period in step 202, which is not described herein again in this embodiment of the present application.
Step 205: and updating the activity list in the current activity time period according to the updated global list in the current activity time period and the updated list in the first activity time period.
After updating the global list, the server may update the board list in the current activity period according to the updated board list in the current activity period and the updated board list in the first activity period.
For example, the server may obtain, from the updated leader board of the first activity period, N top-ranked user identifiers of corresponding activity data to obtain N promoted user identifiers, where N is an integer greater than 0; determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period; generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications; and taking the temporary list of the current activity period as the activity list of the current activity period.
A promoting user may be identified for promoting from one activity period to a next activity period based on a preset number of promotions N during a current activity. In this embodiment of the application, after entering the current activity period, since the updated chart of the first activity period may continue to be updated according to the message belonging to the first activity period through step 202, after the updated chart of the first activity period is obtained according to the first message, the server may update the promotion level to the promotion user in the current activity period in real time according to the updated chart of the first activity period. That is, the server may obtain the top N user identifiers from the updated leaderboard of the first activity period as promotion user identifiers of users promoting to the current activity period.
After obtaining the N promotion user identifications, since the server maintains the global list of the current activity period updated in real time, the server may generate a temporary list including the current activity period of the N promotion users according to the updated global list.
The server can search each promotion user identifier from the updated global list; for the searched promotion user identification, obtaining activity data corresponding to the searched promotion user identification from the updated global list, and taking the obtained activity data as target activity data corresponding to the corresponding promotion user identification; and for the searched promotion user identification, setting the target activity data corresponding to the searched promotion user identification as 0.
Although the global list includes data corresponding to the user identifiers of all processed activity messages belonging to the current activity period list, there may be users who have not performed corresponding operations in the current activity period among the promoted users, that is, there may be no activity message corresponding to the promoted user among the processed activity messages belonging to the current activity period. Based on this, for each promotion user identifier, the server may first search whether the promotion user identifier exists in the updated global list, and if so, the server may obtain activity data corresponding to the promotion user identifier in the global list, and use the obtained activity data as target activity data corresponding to the promotion user identifier. Alternatively, if the promotional user identification is not present in the global leaderboard, the server may directly set the target campaign data for the promotional user identification to 0.
After the target activity data corresponding to the N promotion user identifications is determined, the server may rank the N promotion user identifications and the corresponding activity data according to the size of the activity data corresponding to the N promotion user identifications, so as to obtain a temporary list of the current activity period.
After the temporary list in the current activity period is obtained, if the second message is the first activity message belonging to the current activity period and processed by the server, the server does not have the activity list in the current activity period, and in this case, the server may directly use the generated temporary list in the current activity period as the activity list in the current activity period.
Optionally, if the second message is not the first campaign message belonging to the current campaign period processed by the server, the server has created a leader board for the current campaign period from the first campaign message belonging to the current campaign period before the current time. In this case, the server may directly replace the existing campaign list for the current campaign period with the generated temporary list. That is, the temporary list is directly used as the list of the current activity period.
Therefore, in the current period, the promotion users are updated in real time by updating the activity list in the first activity period in real time, and then the activity list in the current activity period is updated according to the updated promotion users, so that the promotion users in the activity list in the current activity period are ensured to be consistent with the users who should promote in the activity list in the first activity period all the time.
In the embodiment of the application, the server may update the chart of the activity in the first activity period according to the first message, and then update the global chart of the current activity period according to the second message. Because the global list contains the user data carried by all the messages belonging to the current activity time period, even if the first message is delayed, the correct activity list of the current activity time period can still be obtained according to the updated global list and the updated list of the first activity time period, and the problem that the activity list of the current activity time period is wrong due to promoted user errors caused by message delay is solved.
In addition, in the embodiment of the application, in the current activity period, the activity list in the first activity period may be updated in real time according to the activity message belonging to the first activity period, that is, the promotion user in the current activity period may be updated according to the activity list in the first activity period updated in real time, and then the activity list in the current activity period may be generated according to the updated promotion user.
Next, taking the anchor competition activity set in the live broadcast application as an example, an effect of the update method of the activity list provided in the embodiment of the present application is illustrated.
Assume that the anchor competition activity includes three activity periods, an S1 period, an S2 period, and an S3 period, respectively. Suppose that the 00:00:00 of 2019-12-02 is preceded by a period of S1, the 00:00:00-23:59 of 2019-12-02 is followed by a period of S2, and the 00:00 of 2019-12-3 is followed by a period of S3. The current message queue comprises four unprocessed active messages, and the four active messages are respectively a message A, a message B, a message C and a message D according to the sequence of the four active messages in the message queue. The user data and corresponding time stamps carried by each message are shown in fig. 3. The timestamp of the message A is 2019-12-01-23:59:59, the carried user identifier is UID1, and the corresponding activity data is 10. The timestamp of the message B is 2019-12-02-00:00:00, the carried user identifier is UID2, and the corresponding activity data is 100. The timestamp of the message C is 2019-12-01-23:59:58, the carried user identifier is UID4, and the corresponding activity data is 11000. The timestamp of the message D is 2019-12-02-00:00:15, the carried user identifier is UID4, and the corresponding activity data is 1000.
In the related art, it is assumed that before the message a is processed, the list of the S1 time period is as shown in fig. 4, in which the UID1 corresponds to the activity data of 10000 ranked first, the UID2 corresponds to the activity data of 9000 ranked second, the UID3 corresponds to the activity data of 8000 ranked third, the UID4 corresponds to the activity data of 7000 ranked fourth. The server may process the message a first, and since the message a is a message belonging to the S1 time period, according to the activity data 10 corresponding to the UID1 in the message a, 10000 corresponding to the UID1 in the S1 list may be updated to 10010, so that the updated list is as shown in fig. 5.
Assuming that the designated time for determining the promoting user set for the S1 time period has arrived after the message a is processed and before the message C is not processed, and the preset number of promoting is 3, since the server has processed only the message a in the message queue and has not yet come to process the message C, the promoting users obtained from the list shown in fig. 5 obtained after processing the message a will be the UID1, the UID2, and the UID 3. Subsequently, the server will update the activity list of the S2 time period in real time according to the activity data of the UID1, the UID2 and the UID3 included in the activity message belonging to the S2 time period, that is, the promotion displayed in the activity list of the S2 time period to the S2 time period will be the UID1, the UID2 and the UID 3.
However, after the designated time has passed, when the server processes to the message C, the server updates the list in the S1 time period according to the message C, and the obtained updated list in the S1 time period will be as shown in fig. 6, at this time, it can be seen from the updated list in the S1 time period that the users who should actually move up to the S2 time period should be the UID1, the UID2, and the UID4, that is, due to the delay of the message C, the S3 is erroneously moved up to the S2 time period.
For the above scenario, if the method provided by the embodiment of the present application is used to update the list, the server determines that the promoting users are UID1, UID2, and UID3 after obtaining the list of the S1 time period as shown in fig. 5 according to the message a.
Thereafter, the server may obtain a global list of the S2 period from the message B, the global list including the UIDs 2 and corresponding campaign data 100. A chart for obtaining a time slot S2 based on the promotion users UID1, UID2, and UID3 is shown in fig. 7.
Next, the server processes the message C, and since the message C belongs to the S1 time period, the activity number 7000 corresponding to the UID4 in the list of the time period S1 shown in fig. 5 is updated to 18000 according to the activity data 11000 carried in the message C, and the list is reordered, so that the updated list of the time period S1 is shown in fig. 6.
Then, the server processes the message D, and since the message D belongs to the time period of S2, the server may first reselect the promoting users from the list shown in fig. 6, where the selected promoting users are UID1, UID2, and UID 4. Then, the server may update the global list according to the message D, and the updated global list includes the UID4 and the UID2, where the activity data corresponding to the UID4 is 1000, and the activity data corresponding to the UID2 is 100. The server acquires activity data corresponding to the promotion users UID2 and UID4 from the global list as target activity data, and sets the target activity data corresponding to the UID1 to 0 because the UID1 is not included in the global list. Thereafter, a temporary list in the S2 time period is generated from the UID1, the UID2, and the UID4, and the respective corresponding target activity data, and as shown in fig. 8, the list in the S2 time period shown in fig. 7 is covered with the temporary list, thereby realizing updating of the list in the S2 time period.
Therefore, by updating the list in the S1 time period in real time, updating the promoting users through the list in the S1 time period, and further updating the list in the current time period according to the maintained global list in the current time period and the updated promoting users, the promoting errors caused by the fact that data is not ready for settlement when the message is delayed can be corrected, and thus the promoting users included in the list in the S2 time period are consistent with the users who can actually promote in the list in the S1 time period.
Next, an apparatus for updating a leaderboard provided in an embodiment of the present application will be described.
Referring to fig. 9, an embodiment of the present application provides an apparatus 300 for updating a leaderboard, where the apparatus 300 includes:
an obtaining module 301, configured to obtain a first message, where the first message is an activity message belonging to a first activity period, and the first activity period is a previous activity period of a current activity period;
a first updating module 302, configured to update the chart of the first activity period according to the first message;
the second obtaining module 303 is further configured to obtain a second message, where the second message is an activity message belonging to the current activity period;
the second updating module 304 is further configured to update the global list in the current activity period according to the second message, where the global list includes user data carried by all messages belonging to the current activity period;
the third updating module 305 is further configured to update the chart of the activity in the current activity period according to the updated global chart of the current activity period and the updated chart of the first activity period.
Optionally, the second message carries user data of a second user, where the user data includes a user identifier and activity data;
the second update module 304 is specifically configured to:
and if the user identification of the second user carried by the second message exists in the global list, updating the activity data corresponding to the user identification of the second user in the global list according to the activity data of the second user carried by the second message.
Optionally, the second updating module 304 is further specifically configured to:
and if the user identification of the second user carried by the second message does not exist in the global list, adding the user data of the second user in the global list.
Optionally, the activity list includes user data of a plurality of users, the user data including user identifications and activity data;
the third updating module 305 is specifically configured to:
acquiring corresponding user identifications with activity data ranked at the top N from the updated activity list of the first activity period to obtain N promotion user identifications, wherein N is an integer larger than 0;
determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period;
generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications;
and taking the temporary list of the current activity period as the activity list of the current activity period.
Optionally, the third updating module 305 is specifically configured to:
searching each promotion user identification from the updated global list;
for the searched promotion user identification, obtaining activity data corresponding to the searched promotion user identification from the updated global list, and taking the obtained activity data as target activity data corresponding to the corresponding promotion user identification;
and for the searched promotion user identification, setting the target activity data corresponding to the searched promotion user identification as 0.
Optionally, the first message carries a timestamp of the first message, the second message carries a timestamp of the second message, and the timestamp is used to indicate a generation time of the corresponding message, or the timestamp is used to indicate a completion time of an operation corresponding to the corresponding message.
Optionally, the first message and the second message are both located in a message queue, and the first message is located before the second message, where the message queue includes a plurality of messages, and the plurality of messages are arranged according to the receiving time sequence of the plurality of messages, or the plurality of messages are arranged according to the weight of the plurality of messages.
In summary, in the embodiment of the present application, the activity list in the first activity period may be updated according to the first message, and then the global list in the current activity period may be updated according to the second message. Because the global list contains the user data carried by all the messages belonging to the current activity time period, even if the first message is delayed, the correct activity list of the current activity time period can still be obtained according to the updated global list and the updated list of the first activity time period, and the problem that the activity list of the current activity time period is wrong due to promoted user errors caused by message delay is solved.
It should be noted that: in the apparatus for updating a leaderboard provided in the foregoing embodiments, when updating a leaderboard, only the division of the functional modules is illustrated, and in practical applications, the above function distribution may be completed by different functional modules as needed, that is, the internal structure of the device may be divided into different functional modules, so as to complete all or part of the above described functions. In addition, the apparatus for updating a leader board provided in the above embodiments and the method embodiment for updating a leader board belong to the same concept, and specific implementation processes thereof are detailed in the method embodiment and are not described herein again.
FIG. 10 is a block diagram illustrating a server 400 for updating a leaderboard according to an example embodiment. The functions of the server in the embodiments shown in fig. 2-8 described above can be implemented by the server shown in fig. 10. The server may be a server in a cluster of background servers. Specifically, the method comprises the following steps:
the server 400 includes a Central Processing Unit (CPU)401, a system memory 404 including a Random Access Memory (RAM)402 and a Read Only Memory (ROM)403, and a system bus 405 connecting the system memory 404 and the central processing unit 401. The server 400 also includes a basic input/output system (I/O system) 406, which facilitates the transfer of information between devices within the computer, and a mass storage device 407 for storing an operating system 413, application programs 414, and other program modules 415.
The basic input/output system 406 includes a display 408 for displaying information and an input device 409 such as a mouse, keyboard, etc. for user input of information. Wherein a display 408 and an input device 409 are connected to the central processing unit 401 through an input output controller 410 connected to the system bus 405. The basic input/output system 406 may also include an input/output controller 410 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, input/output controller 410 may also provide output to a display screen, a printer, or other type of output device.
The mass storage device 407 is connected to the central processing unit 401 through a mass storage controller (not shown) connected to the system bus 405. The mass storage device 407 and its associated computer-readable media provide non-volatile storage for the server 400. That is, the mass storage device 407 may include a computer-readable medium (not shown) such as a hard disk or CD-ROM drive.
Without loss of generality, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, EPROM, EEPROM, flash memory or other solid state memory technology, CD-ROM, DVD, or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that computer storage media is not limited to the foregoing. The system memory 404 and mass storage device 407 described above may be collectively referred to as memory.
According to various embodiments of the present application, the server 400 may also operate as a remote computer connected to a network through a network, such as the Internet. That is, the server 400 may be connected to the network 412 through the network interface unit 411 connected to the system bus 405, or may be connected to other types of networks or remote computer systems (not shown) using the network interface unit 411.
The memory further includes one or more programs, and the one or more programs are stored in the memory and configured to be executed by the CPU. The one or more programs include instructions for performing the method for updating a leaderboard provided by an embodiment of the application.
Embodiments of the present application further provide a non-transitory computer-readable storage medium, where instructions in the storage medium, when executed by a processor of a server, enable the server to perform the method for updating a leaderboard provided in the embodiments shown in fig. 2 to 8.
Embodiments of the present application further provide a computer program product containing instructions, which when run on a computer, cause the computer to perform the method for updating a leaderboard provided by the embodiments of fig. 2-8.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The invention is not to be considered as limited to the particular embodiments shown and described, but is to be understood that various modifications, equivalents, improvements and the like can be made without departing from the spirit and scope of the invention.
Claims (9)
1. A method of updating a leaderboard, the method comprising:
acquiring a first message, wherein the first message is an activity message belonging to a first activity period, and the first activity period is a last activity period of a current activity period;
updating a chart of the first activity period according to the first message, wherein the chart of the first activity period comprises user data of a plurality of users, and the user data comprises user identifications and activity data;
acquiring a second message, wherein the second message is an activity message belonging to the current activity period;
updating a global list of the current activity time period according to the second message, wherein the global list comprises user data carried by all messages belonging to the current activity time period;
acquiring user identifiers with corresponding activity data ranked at the top N from the updated activity list of the first activity time period to obtain N promotion user identifiers, wherein N is an integer larger than 0;
determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period;
generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications;
and taking the temporary list of the current activity time period as the activity list of the current activity time period.
2. The method of claim 1, wherein the second message carries user data of a second user, the user data comprising a user identification and activity data;
the updating the global list of the current activity period according to the second message includes:
if the user identifier of the second user carried by the second message exists in the global list, updating activity data corresponding to the user identifier of the second user in the global list according to the activity data of the second user carried by the second message.
3. The method of claim 2, further comprising:
and if the user identifier of the second user carried by the second message does not exist in the global list, adding the user data of the second user in the global list.
4. The method of claim 1, wherein determining target activity data corresponding to the N promotional user identifiers based on the updated global listing of the current activity period comprises:
searching each promotion user identification from the updated global list;
for the searched promotion user identification, obtaining activity data corresponding to the searched promotion user identification from the updated global list, and taking the obtained activity data as target activity data corresponding to the corresponding promotion user identification;
and for the searched promotion user identification, setting the target activity data corresponding to the searched promotion user identification as 0.
5. The method according to any one of claims 1 to 4, wherein the first message carries a timestamp of the first message, the second message carries a timestamp of the second message, and the timestamp is used to indicate a generation time of a corresponding message, or the timestamp is used to indicate a completion time of an operation corresponding to the corresponding message.
6. The method of claim 5, wherein the first message and the second message are both located in a message queue, and the first message is located before the second message, and wherein the message queue comprises a plurality of messages, and wherein the plurality of messages are arranged according to a receiving time sequence of the plurality of messages, or wherein the plurality of messages are arranged according to a weight of the plurality of messages.
7. An apparatus to update a leaderboard, the apparatus comprising:
a first obtaining module, configured to obtain a first message, where the first message is an activity message belonging to a first activity period, and the first activity period is a previous activity period of a current activity period;
a first updating module, configured to update a chart of the first activity period according to the first message, where the chart of the first activity period includes user data of multiple users, and the user data includes user identifiers and activity data;
a second obtaining module, configured to obtain a second message, where the second message is an activity message belonging to the current activity period;
the second updating module is used for updating the global list in the current activity time period according to the second message, wherein the global list comprises user data carried by all messages belonging to the current activity time period;
a third updating module, configured to obtain, from the updated activity list of the first activity period, N top-ranked user identifiers of corresponding activity data to obtain N promoted user identifiers, where N is an integer greater than 0; determining target activity data corresponding to the N promotion user identifications according to the updated global list of the current activity time period; generating a temporary list of the current activity period according to the N promotion user identifications and target activity data corresponding to the N promotion user identifications; and taking the temporary list of the current activity time period as the activity list of the current activity time period.
8. An apparatus to update a leaderboard, the apparatus comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor executes the executable instructions in the memory to perform the steps of the method of any of the above claims 1-6.
9. A computer-readable storage medium, having stored thereon instructions which, when executed by a processor, carry out the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010093424.2A CN111372089B (en) | 2020-02-14 | 2020-02-14 | Method, device and storage medium for updating activity list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010093424.2A CN111372089B (en) | 2020-02-14 | 2020-02-14 | Method, device and storage medium for updating activity list |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111372089A CN111372089A (en) | 2020-07-03 |
| CN111372089B true CN111372089B (en) | 2021-08-24 |
Family
ID=71211449
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010093424.2A Active CN111372089B (en) | 2020-02-14 | 2020-02-14 | Method, device and storage medium for updating activity list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111372089B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112468834B (en) * | 2020-10-29 | 2023-08-18 | 北京达佳互联信息技术有限公司 | Attribute value updating method, attribute value updating device, electronic equipment, server and storage medium |
| CN112423013B (en) * | 2020-11-19 | 2021-11-16 | 腾讯科技（深圳）有限公司 | Online interaction method, client, server, computing device and storage medium |
| CN115086770B (en) * | 2022-06-13 | 2024-07-30 | 北京达佳互联信息技术有限公司 | Data processing method, device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105323594A (en) * | 2015-10-26 | 2016-02-10 | 广州华多网络科技有限公司 | Online live-broadcast list generation method and device |
| CN109766497A (en) * | 2019-01-22 | 2019-05-17 | 网易（杭州）网络有限公司 | Ranking list generation method and device, storage medium, electronic equipment |
| CN110401843A (en) * | 2019-08-06 | 2019-11-01 | 广州虎牙科技有限公司 | List data-updating method, device, equipment and medium in platform is broadcast live |
| CN110609967A (en) * | 2018-05-28 | 2019-12-24 | 腾讯科技（深圳）有限公司 | List generation method and device and storage medium |
| CN110781373A (en) * | 2019-10-29 | 2020-02-11 | 北京字节跳动网络技术有限公司 | List updating method and device, readable medium and electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070168433A1 (en) * | 2006-01-18 | 2007-07-19 | Morgan Fabian F | System and method for managing an instant messaging contact list |
-
2020
- 2020-02-14 CN CN202010093424.2A patent/CN111372089B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105323594A (en) * | 2015-10-26 | 2016-02-10 | 广州华多网络科技有限公司 | Online live-broadcast list generation method and device |
| CN110609967A (en) * | 2018-05-28 | 2019-12-24 | 腾讯科技（深圳）有限公司 | List generation method and device and storage medium |
| CN109766497A (en) * | 2019-01-22 | 2019-05-17 | 网易（杭州）网络有限公司 | Ranking list generation method and device, storage medium, electronic equipment |
| CN110401843A (en) * | 2019-08-06 | 2019-11-01 | 广州虎牙科技有限公司 | List data-updating method, device, equipment and medium in platform is broadcast live |
| CN110781373A (en) * | 2019-10-29 | 2020-02-11 | 北京字节跳动网络技术有限公司 | List updating method and device, readable medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111372089A (en) | 2020-07-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111372089B (en) | Method, device and storage medium for updating activity list | |
| CN109241242B (en) | Live broadcast room topic recommendation method and device, server and storage medium | |
| CN109547807B (en) | Information processing method and device based on live broadcast and server | |
| CN110012364B (en) | Anchor recommendation method and device and storage medium | |
| US11372805B2 (en) | Method and device for information processing | |
| CN106227807A (en) | Anchor display method and device and electronic equipment | |
| CN109948882B (en) | Task processing method based on block data structure and related equipment | |
| CN111898037A (en) | Method and device for updating ranking list data and server | |
| CN112351350B (en) | Content display method, device, system, equipment and storage medium | |
| US20150186247A1 (en) | Autonomous media version testing | |
| CN110609967B (en) | List generation method and device and storage medium | |
| CN113157714A (en) | List data updating method and device, electronic equipment and storage medium | |
| CN111405297B (en) | Activity list settlement method and device and storage medium | |
| CN112862544A (en) | Object information acquisition method and device and storage medium | |
| CN111352832A (en) | Method and device for automatically testing page | |
| CN114073100A (en) | Mapping views of digital content | |
| CN115779409A (en) | Intelligent generation method of plot unit and related device | |
| CN107113557B (en) | Information processing method and device | |
| CN113230661A (en) | Data synchronization method and device, computer readable medium and electronic equipment | |
| CN113409064A (en) | Advertisement index updating method, advertisement pushing method, device, medium and equipment | |
| CN110598462A (en) | Data presentation method, device and system, electronic equipment and storage medium | |
| CN113127786A (en) | Information pushing method and device, electronic equipment and computer readable medium | |
| CN113797542B (en) | Task data generation method and device, storage medium and electronic device | |
| KR20200139038A (en) | Devices and methods for relaying between game developers and producers | |
| CN113064590A (en) | Method and device for processing interactive components in interactive video |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210112 Address after: 511442 3108, 79 Wanbo 2nd Road, Nancun Town, Panyu District, Guangzhou City, Guangdong Province Applicant after: GUANGZHOU CUBESILI INFORMATION TECHNOLOGY Co.,Ltd. Address before: 511446 24 / F, building B-1, Wanda Plaza, Panyu District, Guangzhou City, Guangdong Province Applicant before: GUANGZHOU HUADUO NETWORK TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211231 Address after: 511400 3011, 79 Wanbo 2nd Road, Nancun Town, Panyu District, Guangzhou City, Guangdong Province Patentee after: Guangzhou Jinhong network media Co.,Ltd. Address before: 511442 3108, 79 Wanbo 2nd Road, Nancun Town, Panyu District, Guangzhou City, Guangdong Province Patentee before: GUANGZHOU CUBESILI INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |