Ranking list data updating method and device, equipment, storage medium and product

By caching multiple ranking data and updating it in time and fragmented, the problems of low efficiency and high load of ranking data in the existing technology are solved, and more efficient data updates and performance improvements are achieved.

CN119056072APending Publication Date: 2024-12-03TENCENT TECHNOLOGY (SHENZHEN) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310632299.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-30
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In the prior art, the update of ranking data depends entirely on the query initiated by the terminal, resulting in the data cache server experiencing huge load on the ranking data generation server when the number of queries and data expires, reducing the update efficiency and performance.

Method used

By cached data from multiple rankings and obtaining their update cycles, update data from different rankings in time and fragmented manner, avoiding the generation of large number of update requests at the same time, improving the update efficiency of the data cache server and reducing the load of the ranking data generation server.

Benefits of technology

By updating the ranking data in time and fragmentation, the update efficiency of the data cache server is improved, the load pressure on the ranking data generation server is reduced, and the system performance is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119056072A_ABST
    Figure CN119056072A_ABST
Patent Text Reader

Abstract

The invention discloses a ranking list data updating method and device, equipment, a storage medium and a product, and belongs to the technical field of computers. The method comprises the following steps: caching ranking list data corresponding to a plurality of ranking lists respectively; updating periods corresponding to at least two ranking lists in the multiple ranking lists are obtained, the at least two ranking lists correspond to the same updating period, and the updating period comprises at least two time slices; and updating ranking list data of different ranking lists in the at least two ranking lists in different time slices in the updating period. By updating the ranking list data of different ranking lists at different times, the situation that a large number of ranking list data updating requests are generated at the same time is avoided, and the updating efficiency of the ranking list data in the data cache server is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present application relate to the field of computer technology, and in particular to a method, device, equipment, storage medium and product for updating ranking data. Background Art

[0002] In online games, in order to promote competition among players, leaderboards are usually set up. Leaderboards are a common technical means to display ranking changes to users.

[0003] In the related art, the query sequence of ranking data is: the terminal sends a ranking data query instruction to the business server; after the business server receives the query instruction, the business server queries the cached ranking data from the data cache server; when there is no cached ranking data in the data cache server or the cached ranking data is expired, the data cache server requests the latest ranking data from the ranking data generation server, so that the terminal obtains the ranking data.

[0004] However, in the above-mentioned related technologies, the update of the ranking data in the data cache server is completely dependent on the ranking data query initiated by the terminal, and the expiration time of all ranking data cached in the data cache server is the same. When the number of queries for the ranking data is large and the ranking data in the data cache server is expired, the data cache server will simultaneously request the latest ranking data from the ranking data generation server. A large number of query requests will bring greater computing pressure to the ranking data generation server, which not only reduces the update efficiency of the ranking data in the data cache server, but also seriously damages the performance of the ranking data generation server. Summary of the invention

[0005] The present application provides a ranking data updating method, device, equipment, storage medium and product, and the technical solution is as follows:

[0006] According to one aspect of the present application, a method for updating ranking data is provided, the method comprising:

[0007] Cache the ranking data corresponding to multiple rankings;

[0008] Obtaining update cycles corresponding to at least two rankings among the multiple rankings, wherein the at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices;

[0009] The ranking data of different rankings in the at least two rankings are updated at different time slices in the update cycle.

[0010] According to one aspect of the present application, a device for updating ranking data is provided, the device comprising:

[0011] A cache module, used to cache the ranking data corresponding to multiple rankings;

[0012] An acquisition module, configured to acquire update periods corresponding to at least two rankings among the plurality of rankings, wherein the at least two rankings correspond to the same update period, and the update period includes at least two time slices;

[0013] An updating module is used to update the ranking data of different rankings in the at least two rankings at different time slices in the updating cycle.

[0014] According to another aspect of the present application, a computer device is provided, comprising: a processor and a memory, wherein at least one computer program is stored in the memory, and the at least one computer program is loaded and executed by the processor to implement the method for updating ranking data as described above.

[0015] According to another aspect of the present application, a computer storage medium is provided, in which at least one computer program is stored. The at least one computer program is loaded and executed by a processor to implement the method for updating ranking data as described above.

[0016] According to another aspect of the present application, a computer program product is provided, which includes a computer program stored in a computer-readable storage medium; the computer program is read and executed from the computer-readable storage medium by a processor of a computer device, so that the computer device executes the method for updating ranking data as described above.

[0017] The beneficial effects of the technical solution provided by this application include at least:

[0018] By caching ranking data corresponding to multiple rankings respectively; obtaining update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; updating ranking data of different rankings in at least two rankings at different time slices in the update cycle. The present application updates ranking data of different rankings at different times, thereby avoiding the generation of a large number of ranking data update requests at the same time, and improving the updating efficiency of ranking data in the data cache server. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 is a schematic diagram of a method for updating ranking data provided by an exemplary embodiment of the present application;

[0021] Figure 2 is a schematic diagram of the architecture of a computer system provided by an exemplary embodiment of the present application;

[0022] Figure 3 is a flowchart of a method for updating ranking data provided by an exemplary embodiment of the present application;

[0023] Figure 4 is a flowchart of a method for updating ranking data provided by an exemplary embodiment of the present application;

[0024] Figure 5 It is a schematic diagram of a national ranking list provided by an exemplary embodiment of the present application;

[0025] Figure 6 is a schematic diagram of rankings of different regions provided by an exemplary embodiment of the present application;

[0026] Figure 7 is a schematic diagram of a ranking list provided by an exemplary embodiment of the present application;

[0027] Figure 8 is a schematic diagram of a ranking title provided by an exemplary embodiment of the present application;

[0028] Fig. 9 is a schematic diagram of a data structure provided by an exemplary embodiment of the present application;

[0029] Fig.10 is a schematic diagram of updating ranking data provided by an exemplary embodiment of the present application;

[0030] Fig.11 This is a schematic diagram comparing access success rates of a ranking data generation server provided by an exemplary embodiment of the present application;

[0031] Fig.12 This is a schematic diagram of CPU usage comparison in a data cache server provided by an exemplary embodiment of the present application;

[0032] Fig.13 is a schematic diagram of a method for updating ranking data provided by an exemplary embodiment of the present application;

[0033] Fig.14 It is a flowchart of updating and managing ranking data provided by an exemplary embodiment of the present application;

[0034] Fig.15 is a flowchart of updating ranking data provided by an exemplary embodiment of the present application;

[0035] Fig.16 is a flowchart of updating ranking data in an update frame provided by an exemplary embodiment of the present application;

[0036] Fig.17 is a block diagram of a device for updating ranking data provided by an exemplary embodiment of the present application;

[0037] Fig.18 It is a structural diagram of a computer device provided by an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0038] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be further described in detail below with reference to the accompanying drawings.

[0039] The present application embodiment provides a schematic diagram of a method for updating ranking data, such as Figure 1 As shown, the method is applied to a data cache server (rankcachesvr), and the method can be executed by the data cache server.

[0040] Exemplarily, the query sequence of ranking data is as follows: terminal 10 sends a ranking query instruction to business server 20; after business server 20 receives the query instruction, business server 20 queries the cached ranking data from at least one sub-data cache server in data cache server 30 according to the business scenario; when there is no cached ranking data in data cache server 30 or the cached ranking data is expired, data cache server 30 requests the latest ranking data from ranking data generation server 40, so that terminal 10 obtains the latest ranking data.

[0041] Optionally, the business server 20 is also referred to as a game hall server;

[0042] The data cache server 30 is used to store ranking data for the terminal 10 to retrieve.

[0043] Exemplarily, the data cache server 30 caches ranking data corresponding to multiple rankings respectively; the data cache server 30 obtains update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; the data cache server 30 updates the ranking data of different rankings among at least two rankings at different time slices in the update cycle.

[0044] The update cycle refers to the update time period corresponding to the ranking data corresponding to the ranking.

[0045] Optionally, the ranking list includes multiple types, and the update cycles corresponding to different types of ranking lists may be the same or different.

[0046] For example, the ranking data includes the rank ranking and the hero ranking. The update cycle of the rank ranking is 20 minutes; the update cycle of the hero ranking is 10 minutes; and the update cycle of the collection ranking is 10 minutes.

[0047] Optionally, the types of rankings include: at least one of: hero rankings, rank rankings, lane rankings, collection rankings, and guild rankings, but are not limited to these, and the embodiments of the present application do not specifically limit this.

[0048] For example, if the hero ranking list includes 10 heroes, then the hero ranking list includes 10 groups of ranking lists, and each hero corresponds to a group of ranking lists. The rankings in each group of ranking lists include at least one of the hero's national ranking list (referred to as the national ranking list), the hero's provincial ranking list (referred to as the provincial ranking list), the hero's city ranking list (referred to as the city ranking list), and the hero's district ranking list (referred to as the district ranking list), but are not limited to these.

[0049] In some embodiments, at least two of the multiple rankings are rankings of the same type, and the same type includes at least two subtypes. The data cache server 30 divides the rankings of the same subtype in the at least two rankings into the same group to obtain at least two groups of rankings; the data cache server 30 updates the ranking data of different groups of rankings in the at least two groups of rankings at different time slices in the update cycle.

[0050] Subtype refers to the secondary classification ranking in the same type of ranking. For example, taking the hero ranking as an example, the type of hero ranking A in the hero ranking is a subtype in the type of the hero ranking.

[0051] For example, at least two rankings include A hero ranking, gold rank ranking, B hero ranking, bronze rank ranking, and C hero ranking. The data cache server 30 divides the rankings belonging to the same subtype into the same group, that is, A hero ranking, B hero ranking, and C hero ranking can be divided into the hero ranking group; the gold rank ranking and bronze rank ranking can be divided into the rank ranking group; and the ranking data of different groups of rankings in the hero ranking group and the rank ranking group can be updated in segments at different times during the update cycle.

[0052] In some embodiments, the time slice is divided into at least two update frames, and the update frame is a sub-time slice of the time slice. For example, the update period can be set to 20 minutes, a time slice is 1 minute, and an update frame is 2 seconds. The data cache server 30 sorts the rankings in the i-th group of rankings in at least two groups of rankings according to the ranking attention; the data cache server 30 updates the rankings in the i-th group of rankings in accordance with the sorting results in at least two update frames in the time slice corresponding to the i-th group of rankings, where i is a positive integer.

[0053] The data cache server includes a hash table and an update management data table. The hash table is used to cache ranking data corresponding to multiple rankings, and the update management data table is used to store the index of the ranking data in the hash table; the data cache server 30 traverses the index corresponding to the ranking in each update frame of at least two update frames; the data cache server 30 reads the ranking identifier corresponding to the ranking in the i-th group of rankings from the hash table according to the index; the data cache server 30, according to the sorting result, sequentially requests the ranking data generation server to obtain the ranking update data corresponding to the ranking identifier in the i-th group of rankings, and obtains the updated i-th group of rankings.

[0054] The ranking data generating server is used to generate ranking data.

[0055] Optionally, the update management data table is also used to store ranking data and the index of the ranking data in the hash table. When the ranking data is stored in the update management data table, the data cache server 30 traverses the index corresponding to the ranking in each update frame of at least two update frames; the data cache server 30 reads the ranking identifier corresponding to the ranking in the i-th group of rankings from the update management data table according to the index; the data cache server 30 requests the ranking data generation server to obtain the ranking update data corresponding to the ranking identifier in the i-th group of rankings in turn according to the sorting result, and obtains the updated i-th group of rankings.

[0056] It should be noted that all leaderboards in the same group are updated within the same time slice.

[0057] For example, the update cycle corresponding to the hero ranking list is 20 minutes, and one time slice in the update cycle is 1 minute. For example, the rankings of 5 heroes in the hero ranking list need to be updated, that is, the hero ranking list includes 5 groups of ranking lists, and the 5 groups of ranking lists are distributed in the first 5 time slices in the update cycle for updating, that is, the ranking data of the first hero is updated in the first minute, the ranking data of the second hero is updated in the second minute, and the ranking data of the third hero is updated in the third minute, and so on, so that the update process of the entire hero ranking list is distributed in different time slices in the unified cycle. After determining the time slice corresponding to the ranking data of each hero, the hero ranking list is updated in at least one update frame in each time slice, for example, the provincial ranking list of the first hero is updated in the first update frame in the time slice, and the city ranking list of the first hero is updated in the second update frame in the time slice. Through the above method, not only the update efficiency of the ranking data is improved, but also the problem of high load pressure on the ranking data generation server 40 caused by sending requests to the ranking data generation server 40 at the same time is avoided.

[0058] Optionally, the manner of sorting the rankings in the i-th group of rankings includes at least one of the following, but is not limited thereto:

[0059] Sort the rankings in the i-th group of rankings according to their index order in the hash table;

[0060] Sort by activity level of the rankings in the i-th group of rankings;

[0061] Sort the rankings in the i-th group of rankings by their complexity.

[0062] In some embodiments, the data cache server 30 divides rankings of the same subtype in at least two rankings into the same group to obtain a single group of rankings; the data cache server 30 updates the ranking data of different rankings in the single group of rankings in at least two update frames in a single time slice in an update cycle.

[0063] The second type of leaderboard includes only one set of leaderboards.

[0064] For example, there is only one group of rankings in the rank rankings, which includes the national rank rankings (referred to as the national rankings), the provincial rank rankings (referred to as the provincial rankings), the city rank rankings (referred to as the city rankings), and the district rank rankings (referred to as the district rankings).

[0065] Exemplarily, the data cache server 30 sorts the rankings in a single group of rankings according to the ranking attention; the data cache server 30 updates the ranking data of different rankings in the single group of rankings in accordance with the sorting results in at least two update frames in a single time slice corresponding to the single group of rankings.

[0066] For example, when updating the rank ranking list, the update period corresponding to the rank ranking list is 10 minutes, one time slice is 1 minute, and the interval between each update frame is 2 seconds. Then, the total number of frames of a single time slice is 30. Since there is only one set of rankings in the rank ranking list, that is, the ranking data of different rankings in the rank ranking list are updated in the first update frame in the first time slice to obtain the updated rank ranking list.

[0067] In summary, the method provided in this embodiment caches ranking data corresponding to multiple rankings respectively; obtains update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; updates ranking data of different rankings in at least two rankings at different time slices in the update cycle. This application updates ranking data of different rankings at different times, thereby avoiding the generation of a large number of ranking data update requests at the same time, improving the update efficiency of ranking data in the data cache server, and reducing the load pressure of the ranking data generation server.

[0068] Figure 2 The schematic diagram of the architecture of a computer system provided by an embodiment of the present application is shown. The computer system may include: a terminal 100 and a data cache server 200 .

[0069] The terminal 100 may be an electronic device such as a mobile phone, a tablet computer, a vehicle terminal (vehicle computer), a wearable device, a personal computer (PC), a vehicle terminal, an aircraft, an unmanned vending terminal, etc. The terminal 100 may be installed with a client that runs a target application, and the target application may be an application that refers to the ranking display, or may be other applications that provide a ranking display function, which is not limited in this application. In addition, this application does not limit the form of the target application, including but not limited to an application (Application, App) installed in the terminal 100, a mini-program, etc., and may also be in the form of a web page.

[0070] The data cache server 200 can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud computing services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), and cloud servers for basic cloud computing services such as big data. The data cache server 200 can be the background server of the above-mentioned target application, used to provide background services for the client of the target application.

[0071] Among them, cloud technology refers to a hosting technology that unifies hardware, software, network and other resources in a wide area network or local area network to realize data computing, storage, processing and sharing. Cloud technology is a general term for network technology, information technology, integration technology, management platform technology, application technology, etc. based on the cloud computing business model. It can form a resource pool, which is used on demand and flexible and convenient. Cloud computing technology will become an important support. The background services of the technical network system require a large amount of computing and storage resources, such as video websites, picture websites and more portal websites. With the high development and application of the Internet industry, in the future, each item may have its own identification mark, and all need to be transmitted to the background system for logical processing. Data of different levels will be processed separately. All kinds of industry data require strong system backing support, which can only be achieved through cloud computing.

[0072] In some embodiments, the data cache server can also be implemented as a node in a blockchain system. Blockchain is a new application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanism, and encryption algorithm. Blockchain is essentially a decentralized database, a string of data blocks generated by cryptographic methods. Each data block contains a batch of network transaction information, which is used to verify the validity of its information (anti-counterfeiting) and generate the next block. Blockchain can include the blockchain underlying platform, platform product service layer, and application service layer.

[0073] The terminal 100 and the data cache server 200 may communicate with each other via a network, such as a wired or wireless network.

[0074] The method for updating ranking data provided in the embodiment of the present application can be performed by a computer device, which refers to an electronic device with data calculation, processing and storage capabilities. Figure 2Taking the implementation environment of the solution shown as an example, the method for updating the ranking data can be executed by the data cache server 200, or by the terminal 100 and the data cache server 200 in interactive cooperation, which is not limited in the present application.

[0075] Figure 3 1 is a flowchart of a method for updating ranking data provided by an exemplary embodiment of the present application. The method can be executed by a data cache server. The method includes:

[0076] Step 302: Cache ranking data corresponding to multiple rankings respectively.

[0077] The data cache server is used to store ranking data for terminal retrieval.

[0078] A ranking list is a list used to reflect the objective strength of a certain related similar thing, and it has a comparative nature.

[0079] The ranking types in multiple rankings can be rankings of the same type or rankings of different types.

[0080] The ranking data includes at least one type of ranking. The ranking types in the ranking data include: at least one of hero rankings, rank rankings, lane rankings, collection rankings, and guild rankings, but not limited to this, and the embodiments of the present application do not specifically limit this.

[0081] A sub-genre ranking list is included in a ranking list of the same genre, and at least one ranking list is included in a sub-genre ranking list.

[0082] For instance, taking the hero ranking list as an example, the hero ranking list includes 10 heroes, and the hero ranking list includes 10 sub-type ranking lists. The sub-type ranking list refers to the group ranking list corresponding to each hero. The group ranking list corresponding to each hero includes at least one of the hero's national ranking list (referred to as the national ranking list), the hero's provincial ranking list (referred to as the provincial ranking list), the hero's city ranking list (referred to as the municipal ranking list), and the hero's district ranking list (referred to as the district ranking list), but is not limited to these.

[0083] In other words, the categories of hero rankings belong to the first level classification, the categories of subtype rankings (group rankings) belong to the second level classification, and the categories of specific rankings belong to the third level classification.

[0084] Step 304: Obtain update periods corresponding to at least two ranking lists among the multiple ranking lists.

[0085] The update period refers to the update time period corresponding to the ranking data. The update period in the embodiment of the present application can be customized.

[0086] Optionally, the update cycles corresponding to different types of ranking lists may be the same or different.

[0087] For example, the ranking data includes the rank ranking and the hero ranking. The update cycle of the rank ranking is 20 minutes; the update cycle of the hero ranking is 10 minutes; and the update cycle of the collection ranking is 10 minutes.

[0088] The update cycle includes at least two time slices, and a time slice is a time unit belonging to the update cycle. For example, the update cycle is 20 minutes, and a time slice is 1 minute.

[0089] Step 306: updating the ranking data of different rankings in at least two rankings at different time slices in the update cycle.

[0090] Exemplarily, the data cache server updates ranking data of different ranking groups in at least two ranking groups in different time slices in an update cycle to obtain updated ranking data of different ranking groups.

[0091] For example, at least two rankings include the A hero ranking, the gold rank ranking, the B hero ranking, and the C hero ranking. When the update cycles corresponding to the grids of the A hero ranking, the gold rank ranking, the B hero ranking, and the C hero ranking are the same, the ranking data of the A hero ranking, the gold rank ranking, the B hero ranking, and the C hero ranking are updated in different time slices in the update cycle. For example, the A hero ranking is updated in the first time slice of the update cycle, the gold rank ranking is updated in the second time slice, the B hero ranking is updated in the third time slice, and the ranking data of the C hero ranking is updated in the fourth time slice.

[0092] When the update cycles corresponding to the grids of the A hero ranking, gold rank ranking, B hero ranking, and C hero ranking are different, the ranking data of the A hero ranking, B hero ranking, and C hero ranking are updated in different time slices in the update cycle corresponding to the hero ranking. For example, the A hero ranking is updated in the first time slice in the update cycle, the C hero ranking is updated in the second time slice, and the B hero ranking is updated in the third time slice; the ranking data of the gold rank ranking is updated in the time slice in the update cycle corresponding to the rank ranking.

[0093] In summary, the method provided in this embodiment caches ranking data corresponding to multiple rankings respectively; obtains update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; updates ranking data of different rankings in at least two rankings at different time slices in the update cycle. This application updates ranking data of different rankings at different times, thereby avoiding the generation of a large number of ranking data update requests at the same time, improving the update efficiency of ranking data in the data cache server, and reducing the load pressure of the ranking data generation server.

[0094] Figure 4 1 is a flowchart of a method for updating ranking data provided by an exemplary embodiment of the present application. The method can be executed by a data cache server. The method includes:

[0095] Step 402: Cache ranking data corresponding to multiple rankings respectively.

[0096] The data cache server is used to store ranking data for terminal retrieval.

[0097] A ranking list is a list used to reflect the objective strength of a certain related similar thing, and it has a comparative nature.

[0098] The ranking data includes at least one type of ranking. The ranking types in the ranking data include: at least one of hero rankings, rank rankings, lane rankings, collection rankings, and guild rankings, but not limited to this, and the embodiments of the present application do not specifically limit this.

[0099] For example, Figure 5 The schematic diagram of the national ranking list shown in the figure is the national ranking list. The national ranking list refers to the ranking across the country. The ranking list includes ranking, avatar, user account name, geographic location, rank and ranking score.

[0100] For example, Figure 6 The schematic diagram of the rankings of different regions is shown. By triggering the region selection control 601, the rankings of different regions can be obtained. The rankings of different regions include at least one of the national rankings (referred to as the national rankings), the provincial rankings (referred to as the provincial rankings), the city rankings (referred to as the city rankings), and the district rankings (referred to as the district rankings), but are not limited to these.

[0101] Multiple ranking lists refer to ranking lists of the same type cached in the data cache server, or ranking lists of different types cached in the data cache server.

[0102] For example, Figure 7The schematic diagram of the ranking list shown in the figure shows the gap prompt mark 701 between the current ranking list of the user account and the next level ranking list in the personal data interface corresponding to the user account. The gap prompt mark 701 includes the total score of the current ranking list, the ranking score of the next level ranking list and the level corresponding to the ranking score of the next level ranking list, such as "reaching the ranking score of the next level ranking list can enter the top 10 of Province B". In addition, after obtaining different ranking lists, the corresponding ranking title can be obtained in the ranking list according to the score of the user account, such as Figure 8 The schematic diagram of the ranking titles shown is that the corresponding ranking titles 801 can be obtained according to the performance of the user account in different rankings, and the player can use the ranking title 801 as his or her honorary title.

[0103] Step 404: Obtain update periods corresponding to at least two ranking lists among the multiple ranking lists.

[0104] The update period refers to the update time period corresponding to the ranking data. The update period in the embodiment of the present application can be customized.

[0105] Optionally, the update cycles corresponding to different types of ranking lists may be the same or different.

[0106] The update cycle includes at least two time slices, and a time slice is a time unit belonging to the update cycle. For example, the update cycle is 20 minutes, and a time slice is 1 minute.

[0107] For example, Fig. 9 The schematic diagram of the data structure shown in the figure, as shown in the figure, the data structure of the ranking data corresponding to the ranking list includes:

[0108] (1) Ranking instance RankKey: The key structure of the ranking instance 901 is used to identify a ranking instance and is the unique identifier of the ranking instance. Among them, RankId is the ranking identifier, indicating a ranking; WarzoneType indicates the region type of the ranking instance 901, and the value range is (country, province, city, district); WarzoneId indicates the region identifier. For example, the RankId of the national ranking in the rank ranking is 1, the WarzoneType is 1, and the WarzoneId is 0; the RankId of the B city C district ranking of hero A is 10003 (hero identifier A), the WarzoneType type is 4, and the WarzoneId is 440305.

[0109] (2) Ranking data RankUnit: A ranking data 902 of the ranking instance 901 refers to the data received by the ranking data generation server and ranked in the ranking list. Uin represents the unique identifier of the player, RankNo represents the ranking on the ranking list, and RankScore represents the ranking score.

[0110] (3) Cache data RankCache: The cache data 903 of a ranking instance refers to the ranking data cached in the hash table in the data cache server. The RankKey in the cache data 903 is the key structure of the ranking instance 901, and RankData is a list of all the ranked data 902.

[0111] (4) Ranking list snapshot data RankCacheSnapshot: Ranking list snapshot data 904 is the snapshot information of cache data 903 cached in the data cache server, where RankKey is the Key structure of the ranking list instance 901, and Pos is the index position of the current ranking list in the hash table.

[0112] (5) Slice data RankFreshSlice: Updates the slicing data 905 of the ranking data. Slice data 905 refers to the ranking data corresponding to the ranking updated in a time slice. In a unit of time, the ranking of the slice will perform an update operation once. The slice execution frame number TickFrame is the number of frames executed in the time slice, and SnapShot is a list of snapshot data of the ranking belonging to this slice.

[0113] (6) Single Slice Refresh Cycle: Single Slice Refresh Cycle 906 means that only one time slice completes the update operation in one update cycle. It is used for types such as rank, guild, collection, and lane where there is only one or a small number of RankIds in one ranking type. FramesPerCycle refers to the total number of frames in the entire cycle, FramesPerSlice is the total number of frames in a single slice, TickFrame is the number of frames currently executed in the cycle, and the value range is [0, FramesPerCycle-1], and Slice is the slice data.

[0114] (7) MultiSliceRefreshCycle: MultiSliceRefreshCycle means that there are multiple time slices in one update cycle, and each time slice is processed in sequence, that is, after processing the last frame of the previous time slice, the first frame of the next time slice is entered. It is used for hero ranking types. This type has more than 100 RankIds (i.e. hero IDs). SlicesPerCycle refers to the total number of slices in the entire cycle, FramesPerSlice is the total number of frames of a single slice, TickSlice is the slice index currently executed in the cycle, and SliceList is the slice list.

[0115] (8) Update management data table RefreshTickList: LastTickTime in update management data table 908 is the time of the last execution of the update frame, FrameTicked is the total number of frames executed, DefaultCycle manages the default update cycle ranking list, these types of ranking lists share a common update cycle, and for ranking lists that need to be customized through configuration and have a separate update cycle, a new cycle structure needs to be added. For example, GradeCycle manages the rank type ranking list, SkinCycle manages the collection type ranking list, and HeroCycle manages the hero type ranking list.

[0116] (9) Cycle configuration structure RefreshCycleCfg: The ranking type cycle configuration structure 909 refers to a custom configuration for the update cycle. According to the cycle structure defined in the management data RefreshTickList for frame updates, the cycle time of each type is increased. For example, DefaultCycle represents the update cycle of the default type ranking, and GradeCycle represents the update cycle of the grade ranking.

[0117] Step 406: Rankings of the same sub-type in at least two rankings are divided into the same group to obtain at least two groups of rankings.

[0118] Exemplarily, at least two of the multiple rankings are rankings of the same type, and the same type includes at least two subtypes. The data cache server divides the rankings of the same subtype in the at least two rankings into the same group to obtain at least two groups of rankings.

[0119] Subtype refers to the secondary classification ranking in the same type of ranking. For example, taking the hero ranking as an example, the type of hero ranking A in the hero ranking is a subtype in the type of the hero ranking.

[0120] For example, at least two rankings include A hero ranking, gold rank ranking, B hero ranking, bronze rank ranking, and C hero ranking. The data cache server 30 divides the rankings belonging to the same subtype into the same group, that is, A hero ranking, B hero ranking, and C hero ranking can be divided into the hero ranking group; the gold rank ranking and bronze rank ranking can be divided into the rank ranking group; and the ranking data of different groups of rankings in the hero ranking group and the rank ranking group can be updated in segments at different times during the update cycle.

[0121] Optionally, each of the multiple rankings corresponds to a ranking identifier, and the rankings in at least two rankings are divided into groups using the ranking identifiers.

[0122] Step 408: updating the ranking data of different ranking groups in at least two ranking groups at different time slices in the update cycle.

[0123] The data cache server updates the ranking data of different groups of rankings in at least two groups of rankings at different time slices in the update cycle, that is, the update process of different groups of rankings in at least two groups of rankings is completed in different time slices.

[0124] The time slice is divided into at least two update frames. The update frame is a sub-time slice of the time slice. For example, the update period can be set to 20 minutes, a time slice is 1 minute, and an update frame is 2 seconds.

[0125] For example, Fig.10The schematic diagram of ranking data update shown in the figure includes hash table 1001, update management data table 1002 and update cycle table 1003. Hash table 1001 is used to cache ranking data corresponding to multiple rankings respectively. Update management data table 1002 is used to store the index of ranking data in hash table 1001 and manage the data in the ranking data update process. Update cycle table 1003 includes update cycles corresponding to different types of rankings. For example, the update cycle of the default ranking is 1200s, the update cycle of the rank ranking is 600s, the update cycle of the collection ranking is 300s, and the update cycle of the hero ranking is 1200s. As shown in the figure, since the guild ranking data belongs to a subtype, the guild ranking data is placed in a time slice in the update cycle of the default ranking for update; two rank ranking data are cached in the hash table 1001, corresponding to index 3 and index 5 respectively. Since the identifiers in the rank ranking data corresponding to index 3 and index 5 are different, the rank ranking data corresponding to index 3 and index 5 belong to a subtype, so the rank ranking data corresponding to index 3 and index 5 are placed in the same time slice in the rank update cycle corresponding to the rank ranking for update; since the collection ranking data belongs to a subtype, the collection ranking data is placed in a time slice in the collection update cycle corresponding to the collection ranking for update; three hero ranking data are cached in the hash table 1001, corresponding to indexes 4, 7, and 10 respectively. Since the identifiers in the hero ranking data corresponding to indexes 4, 7, and 10 are different, the hero ranking data corresponding to indexes 4, 7, and 10 correspond to a subtype respectively, so the hero ranking data corresponding to indexes 4, 7, and 10 are placed in different time slices in the hero update cycle corresponding to the hero ranking for update.

[0126] In some embodiments, the data cache server sorts the rankings in the i-th group of rankings in at least two groups of rankings according to the ranking attention; the data cache server updates the rankings in the i-th group of rankings in sequence according to the sorting results in at least two update frames in the time slice corresponding to the i-th group of rankings, where i is a positive integer.

[0127] The data cache server includes a hash table and an update management data table. The hash table is used to cache ranking data corresponding to multiple rankings, and the update management data table is used to store the index of the ranking data in the hash table; the data cache server traverses the index corresponding to the ranking in each update frame of at least two update frames; the data cache server reads the ranking identifier corresponding to the ranking in the i-th group of rankings from the hash table according to the index; the data cache server requests the ranking data generation server to obtain the ranking update data corresponding to the ranking identifier in the i-th group of rankings in turn according to the sorting result, and obtains the updated i-th group of rankings.

[0128] The ranking data generation server is used to receive the reported ranking scores, rank the reported players and ranking scores, and query the ranking information of the specified ranking. For example, the Apollo server.

[0129] Optionally, the update management data table is also used to store ranking data and the index of the ranking data in the hash table. When the ranking data is stored in the update management data table, the data cache server traverses the index corresponding to the ranking in each update frame of at least two update frames; the data cache server reads the ranking identifier corresponding to the ranking in the i-th group of rankings from the update management data table according to the index; the data cache server requests the ranking data generation server to obtain the ranking update data corresponding to the ranking identifier in the i-th group of rankings in turn according to the sorting result, and obtains the updated i-th group of rankings.

[0130] It should be noted that all leaderboards in the same group are updated within the same time slice.

[0131] For example, the update cycle corresponding to the hero ranking list is 20 minutes, and one time slice in the update cycle is 1 minute. For example, the rankings of 5 heroes in the hero ranking list need to be updated, that is, the hero ranking list includes 5 groups of ranking lists, and the 5 groups of ranking lists are distributed in the first 5 time slices in the update cycle for update, that is, the ranking data of the first hero is updated in the first minute, the ranking data of the second hero is updated in the second minute, and the ranking data of the third hero is updated in the third minute, and so on, so that the update process of the entire hero ranking list is distributed in different time slices in the unified cycle. After determining the time slice corresponding to the ranking data of each hero, the hero ranking list is updated in at least one update frame in each time slice, for example, the provincial ranking list of the first hero is updated in the first update frame in the time slice, and the city ranking list of the first hero is updated in the second update frame in the time slice. The above method not only improves the update efficiency of the ranking data, but also avoids the problem of high load pressure on the ranking data generation server caused by sending requests to the ranking data generation server at the same time.

[0132] Optionally, the manner of sorting the rankings in the i-th group of rankings also includes at least one of the following, but is not limited thereto:

[0133] Sort the rankings in the i-th group of rankings according to their index order in the hash table;

[0134] Sort by activity level of the rankings in the i-th group of rankings;

[0135] Sort the rankings in the i-th group of rankings by their complexity.

[0136] In some embodiments, the data cache server divides rankings of the same subtype in at least two rankings into the same group to obtain a single group of rankings; the data cache server updates the ranking data of different rankings in the single group of rankings in at least two update frames in a single time slice in an update cycle.

[0137] The second type of leaderboard includes only one set of leaderboards.

[0138] For example, there is only one group of rankings in the rank rankings, which includes the national rank rankings (referred to as the national rankings), the provincial rank rankings (referred to as the provincial rankings), the city rank rankings (referred to as the city rankings), and the district rank rankings (referred to as the district rankings).

[0139] Exemplarily, the data cache server sorts the rankings in a single group of rankings according to the ranking attention; the data cache server updates the ranking data of different rankings in the single group of rankings in sequence according to the sorting results in at least two update frames in a single time slice corresponding to the single group of rankings.

[0140] For example, when updating the rank ranking list, the update period corresponding to the rank ranking list is 10 minutes, one time slice is 1 minute, and the interval between each update frame is 2 seconds. Then, the total number of frames of a single time slice is 30. Since there is only one set of rankings in the rank ranking list, that is, the ranking data of different rankings in the rank ranking list are updated in the first update frame in the first time slice to obtain the updated rank ranking list.

[0141] In some embodiments, the data cache server obtains the update cycles corresponding to at least two types of rankings of multiple rankings, and the update cycles corresponding to different types of rankings are different; the data cache server updates the ranking data of different rankings of at least two types of rankings in the update cycles corresponding to the at least two types of rankings, respectively, and different types of rankings correspond to different update cycles, so that the update of the ranking data will not be concentrated in one place, avoiding the generation of a large number of ranking data update requests at the same time, improving the update efficiency of the ranking data in the data cache server, and reducing the load pressure of the ranking data generation server.

[0142] For example, the rank ranking corresponds to the first update cycle, and the hero ranking corresponds to the second update cycle. The values ​​of the first update cycle and the second update cycle are different. When the rank ranking and the hero ranking are updated, they are updated in the update cycles corresponding to each other.

[0143] Optionally, the data cache server obtains ranking list identifiers corresponding to the multiple ranking lists respectively; the data cache server classifies the multiple ranking lists according to the ranking list identifiers, thereby obtaining at least two ranking lists belonging to different types.

[0144] In some embodiments, the data cache server obtains the update cycles corresponding to different types of rankings in multiple rankings cached by the first sub-data cache server; the data cache server synchronizes the update cycles corresponding to different types of rankings in the first sub-data cache server to a second sub-data cache server in the data cache server; wherein the second sub-data cache server is any sub-data cache server in the data cache server except the first sub-data cache server.

[0145] The data cache server is a server cluster, and the data cache server includes at least two sub-data cache servers.

[0146] Optionally, the data cache server periodically synchronizes update periods corresponding to ranking lists of the same type in at least two sub-data cache servers.

[0147] Optionally, when the update period corresponding to the first ranking list in the first sub-data cache server is modified, the data cache server synchronizes the revised update period corresponding to the first ranking list in the first sub-data cache server to the second sub-data cache server in the data cache server, that is, keeps the update period corresponding to the first ranking list in the second sub-data cache server consistent with the update period corresponding to the first ranking list in the first sub-data cache server.

[0148] In some embodiments, in order to further reduce the request load of the data cache server to the ranking data generation server, when the first sub-data cache server sends an update request to the ranking data generation server, the update request in the first sub-data cache server is routed to the second sub-data cache server in the data cache server, and the update request is sent to the ranking data generation server through the second sub-data cache server. After obtaining the updated ranking data in the second sub-data cache server, the second sub-data cache server synchronizes the obtained updated ranking data to the first sub-data cache server.

[0149] For example, in order to verify the difference between the ranking data updating method provided in the embodiment of the present application and the related art, the access success rate of the ranking data generating server is used as a test factor to detect the access success rate of the ranking data generating server in the method provided in the embodiment of the present application and the related art. Fig.11The access success rate comparison diagram of the ranking data generation server shown. Figure (a) is the access success rate of the ranking data generation server in the ranking data update method provided in the embodiment of the present application, and Figure (b) is the access success rate of the ranking data generation server in the ranking data update method provided in the related art. By comparing Figure (a) and Figure (b), it can be seen that the ranking data update method provided in the embodiment of the present application disperses the update of the ranking data on different time slices and different update frames, which greatly reduces the request peak to the ranking data generation server, reduces the peak load of the ranking data generation server, and improves the access success rate.

[0150] For example, in order to verify the difference between the ranking data updating method provided in the embodiment of the present application and the related art, the CPU usage in the data cache server is used as a measurement factor to detect the CPU usage in the data cache server in the method provided in the embodiment of the present application and the related art, such as Fig.12 The schematic diagram of the CPU usage comparison in the data cache server shown. Figure (a) shows the CPU usage in the data cache server in the ranking data update method provided in the embodiment of the present application, and Figure (b) shows the CPU usage in the data cache server in the ranking data update method provided in the related art. By comparing Figure (a) and Figure (b), it can be seen that the ranking data update method provided in the embodiment of the present application disperses the update of the ranking data in different time slices and different update frames, and the CPU usage in the data cache server is more stable without spikes.

[0151] In summary, the method provided in this embodiment caches ranking data corresponding to multiple rankings respectively; obtains update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; updates ranking data of different rankings in at least two rankings at different time slices in the update cycle. This application updates ranking data of different rankings at different times, thereby avoiding the generation of a large number of ranking data update requests at the same time, improving the update efficiency of ranking data in the data cache server, and reducing the load pressure of the ranking data generation server.

[0152] The method provided in this embodiment avoids generating a large number of ranking data update requests at the same time by updating the ranking data of different rankings in different update frames in different time slices of the update cycle, improves the updating efficiency of the ranking data in the data cache server, and reduces the load pressure of the ranking data generation server.

[0153] The method provided in this embodiment avoids generating a large number of ranking data update requests at the same time by updating the ranking data of different rankings in different update frames in a single time slice of an update cycle, thereby improving the updating efficiency of the ranking data in the data cache server and reducing the load pressure of the ranking data generation server.

[0154] The method provided in this embodiment can set different update cycles for different types of rankings by customizing the update cycle, thereby staggering the update cycles of different types of rankings, avoiding the generation of a large number of ranking data update requests at the same time, improving the update efficiency of the ranking data in the data cache server, and reducing the load pressure on the ranking data generation server.

[0155] The method provided in this embodiment synchronizes the update cycles of the sub-data cache servers in the data cache server, so that the ranking list data between the sub-data cache servers in the data cache server remain consistent.

[0156] For example, Fig.13 The method for updating ranking data shown is applied to a data cache server.

[0157] The query sequence of the ranking list is as follows: the terminal 10 sends a ranking list query instruction to the business server 20; after the business server 20 receives the query instruction, the business server 20 queries the cached ranking list data from at least one sub-data cache server in the data cache server 30 according to the business scenario; when there is no cached ranking list data in the data cache server 30 or the cached ranking list data is expired, the data cache server 30 requests the latest ranking list data from the ranking list data generation server 40, so that the terminal 10 obtains the latest ranking list data.

[0158] The update process of the ranking data in the data cache server is as follows:

[0159] Cache ranking data corresponding to multiple rankings in a data cache server; the data cache server obtains update cycles corresponding to at least two rankings among the multiple rankings, at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; update ranking data of different rankings in at least two rankings at different time slices in the update cycle.

[0160] In some embodiments, when at least two rankings are of the same type and the same type includes at least two sub-types, the data cache server divides the rankings of the same sub-type in at least two rankings into the same group to obtain at least two groups of rankings; the data cache server updates the ranking data of different groups of rankings in at least two groups of rankings at different time slices in an update cycle.

[0161] Optionally, the time slice is divided into at least two update frames. For multiple groups of rankings, the data cache server sorts the rankings in the i-th group of rankings in at least two groups of rankings according to the ranking attention; the data cache server updates the rankings in the i-th group of rankings in sequence according to the sorting results in at least two update frames in the time slice corresponding to the i-th group of rankings, where i is a positive integer.

[0162] The update frame is a sub-time slice of the time slice.

[0163] The process of updating the leaderboards in multiple leaderboards in at least two update frames is as follows:

[0164] The data cache server traverses the index corresponding to the ranking list in each update frame of at least two update frames; the data cache server reads the ranking list identifier corresponding to the ranking list in the i-th group of ranking lists from the hash table according to the index; the data cache server requests the ranking list data generation server to obtain the ranking list update data corresponding to the ranking list identifier in the i-th group of ranking lists in turn according to the sorting result, and obtains the updated i-th group of ranking lists.

[0165] In some embodiments, when at least two rankings are of the same type and the same type includes only one subtype, the data cache server divides the rankings of the same subtype in at least two rankings into the same group to obtain a single group of rankings; the data cache server updates the ranking data of different rankings in the single group of rankings in at least two update frames in a single time slice in an update cycle.

[0166] Optionally, the time slice is divided into at least two update frames. For a single group of rankings, the data cache server sorts the rankings in the single group of rankings according to the ranking attention. The data cache server updates the ranking data of different rankings in the single group of rankings in sequence according to the sorting results in at least two update frames in a single time slice corresponding to the single group of rankings.

[0167] The process of updating the leaderboard of a single group of leaderboards in at least two update frames is as follows:

[0168] The data cache server traverses the index corresponding to the ranking list in each update frame of at least two update frames; the data cache server reads the ranking list identifier corresponding to the ranking list in the single group ranking list from the hash table according to the index; the data cache server requests the ranking list data generation server to obtain the ranking list update data corresponding to the ranking list identifier in the single group ranking list in turn according to the sorting result, and obtains the updated single group ranking list.

[0169] In some embodiments, different types of rankings have corresponding update cycles. The data cache server obtains the update cycles corresponding to at least two types of rankings of different types among multiple rankings, and updates the ranking data of different rankings in at least two types of rankings in the update cycles corresponding to the at least two types of rankings.

[0170] The ranking type classification process is as follows:

[0171] The data cache server obtains ranking list identifiers corresponding to the multiple ranking lists respectively; the data cache server classifies the multiple ranking lists according to the ranking list identifiers to obtain at least two ranking lists of different types.

[0172] In some embodiments, the data cache server is a server cluster, and the data cache server includes at least two sub-data cache servers. The data cache server obtains the update cycles corresponding to different types of rankings in multiple rankings cached by the first sub-data cache server; the data cache server synchronizes the update cycles corresponding to different types of rankings in the first sub-data cache server to the second sub-data cache server in the data cache server, so that the ranking data between the sub-data cache servers in the data cache server remain consistent.

[0173] The second sub-data cache server is any sub-data cache server among the data cache servers except the first sub-data cache server.

[0174] To sum up, the method provided in this embodiment avoids generating a large number of ranking data update requests at the same time by updating the ranking data of different rankings on different time slices and update frames, thereby improving the update efficiency of the ranking data in the data cache server and reducing the load pressure on the ranking data generation server.

[0175] Fig.14 A flowchart of updating and managing ranking data provided by an exemplary embodiment of the present application is shown. The method can be executed by a data cache server.

[0176] Step 1401: Start.

[0177] Step 1402: Obtain the update period according to the ranking list identifier.

[0178] When the data cache server starts, it will initialize the update cycle in the update management data table RefreshTickList. The main tasks are:

[0179] (1) Configure the update cycle according to the cycle configuration structure RefreshCcyleCfg, and set constant data for each update cycle, including the single-slice update cycle SingleSliceRefreshCycle, the total number of frames in the entire cycle FramesPerCycle and the total number of frames in a single slice FramesPerSlice, and the total number of slices in the entire cycle SlicesPerCycle and the total number of frames in a single slice FramesPerSlice in the multi-slice update cycle Multi SliceRefreshCycle. For example, if the interval of each update frame is set to 2 seconds, the execution duration of a time slice is 1 minute, the update cycle GradeCycle of the rank ranking is 10 minutes, and the update cycle HeroCycle of the hero ranking is 20 minutes, then the total number of frames GradeCycle.FramePerCycle of the entire update cycle of the hero ranking is 300, and the total number of frames GradeCycle.FramesPerS lice of the entire update cycle of the rank ranking is 30; the update cycle HeroCycle.SlicesPerCycle of a single slice of the hero ranking is 20, and the total number of frames HeroCycle.FramesPerSlice of a single slice of the hero ranking is 30.

[0180] (2) According to the current system time systime (Unix system seconds), initialize each update cycle and the slice execution frame number TickFrame data of the time slice. Taking the GradeCycle as an example, its TickFame is (systime%300) / 2. Among them, 300 is the update cycle of the grade ranking in seconds, and 2 is the interval of each update frame.

[0181] When the data cache server is started, the hash table and the update management data table are both empty tables. When the terminal triggers the first request for ranking data from the ranking data generation server and successfully adds it to the hash table, the cache snapshot data of the ranking data is added to the update management data table.

[0182] The data cache server obtains the corresponding update period of the ranking list according to the ranking list identifier in the hash table. For example, if the ranking list is a rank ranking list, the rank ranking list will be updated in the rank update period corresponding to the rank ranking list.

[0183] Step 1403: Determine whether the update cycle uses multiple time slices.

[0184] Exemplarily, determine whether the update cycle uses multiple time slices to update the ranking list. If multiple time slices are used to update the ranking list during the update cycle, execute step 1404; if multiple time slices are not needed to update the ranking list during the update cycle, execute step 1405.

[0185] Step 1404: Obtain the corresponding time slice according to the ranking list identifier.

[0186] Exemplarily, when multiple time slices are used to update the ranking list in an update cycle, the time slice corresponding to the ranking list in the update cycle is determined according to the ranking list identifier in the hash table.

[0187] Step 1405: Add the ranking data to the time slice.

[0188] Exemplarily, only a single time slice is used to update the ranking list in the update cycle, or, when the time slice corresponding to the ranking list in the update cycle is determined, the ranking list data is updated in the corresponding time slice.

[0189] Step 1406: End.

[0190] Fig.15 A flowchart of updating ranking data provided by an exemplary embodiment of the present application is shown. The method can be executed by a data cache server.

[0191] Step 1501: Start.

[0192] Step 1502: Traverse the update cycle.

[0193] Exemplarily, one type of ranking list corresponds to one update period, and the data cache server traverses the update period corresponding to each type of ranking list.

[0194] Step 1503: Determine whether the update cycle uses only a single time slice.

[0195] Exemplarily, the data cache server determines whether the current update cycle uses only a single time slice based on the update cycle, and executes step 1504 when the ranking data of the ranking list is updated in different time slices in the update cycle; and executes step 1509 when the ranking data of the ranking list is updated in a single time slice in the update cycle.

[0196] Step 1504: Determine the time slice to which the leaderboard belongs according to the leaderboard identifier.

[0197] Exemplarily, when the ranking data of the ranking list is updated in different time slices in an update cycle, the data cache server determines the time slice to which the ranking list belongs according to the ranking list identifier.

[0198] Step 1505: Execute the update process within the time slice.

[0199] Exemplarily, after determining the time slice to which the updated ranking list belongs, that is, determining that the ranking list is updated in the time slice, the process of updating in the time slice is executed. The specific process of the process of updating in the time slice can be found in the next embodiment.

[0200] Step 1506: Determine whether the update is completed within the time slice.

[0201] Exemplarily, after the data cache server executes the update process within the time slice, it determines whether the update process of the ranking list in the current time slice is completed. If the ranking list is updated in the current time slice, step 1507 is executed; if the ranking list is not updated in the current time slice, step 1508 is executed.

[0202] Optionally, by determining whether the number of frames currently executed in the current time slice TickFrame is 0, it is determined whether the updating process of the ranking list in the current time slice is completed.

[0203] Step 1507: Update the total number of frames in the multi-slice update cycle.

[0204] Exemplarily, when the leaderboard is updated in the current time slice, the total number of frames in the multi-slice update cycle is updated, and the slice tickSlice currently executed in the update cycle is (TickSlice+1)% Slices PerCycle.

[0205] Step 1508: Update the time of the last frame update and the total number of frames executed.

[0206] Exemplarily, when the ranking list has not been completely updated in the current time slice, the time of the last execution of the update frame and the total number of executed frames are updated.

[0207] Step 1509: Determine whether the update is completed within the time slice.

[0208] Exemplarily, when updating the ranking data of the ranking list in a single time slice in the update cycle, determine whether the update process of the ranking list in the current time slice is completed. If the ranking list is updated in the current time slice, execute step 1511; if the ranking list is not updated in the current time slice, execute step 1510.

[0209] Optionally, whether the leaderboard has been updated in the current time slice is determined based on whether the currently executed frame number TickFrame in the single slice update cycle is less than the total frame number FramesPerSlice of a single slice. If the currently executed frame number TickFrame is less than the total frame number FramesPerSlice of a single slice, the slice update is not completed; if the currently executed frame number TickFrame is greater than or equal to the total frame number FramesPerSlice of a single slice, the slice update is completed.

[0210] Step 1510: Execute the process of updating within the time slice.

[0211] Exemplarily, when the ranking list has not been completely updated in the current time slice, the process of updating within the time slice is executed. The specific process of the process of updating within the time slice can be found in the next embodiment.

[0212] Step 1511: Update the total number of frames in a single-slice update cycle.

[0213] Exemplarily, when the ranking list is updated in the current time slice, the total number of frames in the single-slice update cycle is updated.

[0214] Step 1512: End.

[0215] Fig.16 A flowchart of updating ranking data in an update frame provided by an exemplary embodiment of the present application is shown. The method can be executed by a data cache server.

[0216] Step 1601: Start.

[0217] Step 1602: traverse the index corresponding to the ranking list.

[0218] Exemplarily, the data cache server traverses the index corresponding to the ranking list in each update frame.

[0219] Step 1603: Determine whether the current update frame should be updated.

[0220] Exemplarily, the data cache server determines whether the current update frame should update the ranking list, and if the current update frame needs to update the ranking list, executes step 1604; if the current update frame does not need to update the ranking list, executes step 1606.

[0221] Step 1604: Read the ranking list identifier corresponding to the ranking list according to the index.

[0222] Exemplarily, when the current update frame needs to update the ranking list, the ranking list identifier corresponding to the ranking list is read from the hash table according to the index.

[0223] Step 1605: Request the ranking list data generation server for ranking list update data corresponding to the ranking list identifier.

[0224] Exemplarily, when a ranking list identifier corresponding to the ranking list is read, a ranking list data generation server is requested to obtain ranking list update data corresponding to the ranking list identifier.

[0225] Step 1606: Determine whether the traversal is completed.

[0226] Exemplarily, the data cache server determines whether the index corresponding to the ranking list in the update frame has been traversed completely, and executes step 1602 if the index corresponding to the ranking list in the update frame has not been traversed completely; and executes step 1607 if the index corresponding to the ranking list in the update frame has been traversed completely.

[0227] Step 1607: Update the number of frames currently executed in the time slice.

[0228] Exemplarily, when the indexes corresponding to the ranking lists in the update frame are traversed, the number of frames currently executed in the time slice is updated.

[0229] Step 1608: End.

[0230] Fig.17 A schematic diagram of the structure of a ranking data updating device provided by an exemplary embodiment of the present application is shown. The device can be implemented as all or part of a computer device through software, hardware, or a combination of both. The device includes:

[0231] Cache module 1701, used to cache ranking data corresponding to multiple rankings respectively;

[0232] An acquisition module 1702 is used to acquire update cycles corresponding to at least two rankings among the multiple rankings, wherein the at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices;

[0233] The updating module 1703 is configured to update the ranking data of different rankings in the at least two rankings at different time slices in the updating cycle.

[0234] The at least two ranking lists are ranking lists of the same type, and the same type includes at least two sub-types.

[0235] In some embodiments, the update module 1703 is used to divide the rankings of the same subtype in the at least two rankings into the same group to obtain at least two groups of rankings; and update the ranking data of different groups of rankings in the at least two groups of rankings at different time slices in the update cycle.

[0236] The time slice is divided into at least two update frames, and the update frame is a sub-time slice belonging to the time slice.

[0237] In some embodiments, the update module 1703 is used to sort the rankings in the i-th group of rankings in the at least two groups of rankings according to the ranking attention; in at least two update frames in the time slice corresponding to the i-th group of rankings, the rankings in the i-th group of rankings are updated in sequence according to the sorting results, where i is a positive integer.

[0238] The data cache server includes a hash table and an update management data table. The hash table is used to cache the ranking data corresponding to the multiple rankings respectively, and the update management data table is used to store the index of the ranking data in the hash table.

[0239] In some embodiments, the update module 1703 is used to traverse the index corresponding to the ranking list in each update frame of the at least two update frames; read the ranking list identifier corresponding to the ranking list in the i-th group of ranking lists from the hash table according to the index; and according to the sorting result, sequentially request the ranking list data generation server to obtain the ranking list update data corresponding to the ranking list identifier in the i-th group of ranking lists to obtain the updated i-th group of ranking lists.

[0240] The at least two rankings are rankings of the same type, and the same type includes a subtype; in some embodiments, the update module 1703 is used to divide the rankings of the same subtype in the at least two rankings into the same group to obtain a single group of rankings; and update the ranking data of different rankings in the single group of rankings in at least two update frames in a single time slice in the update cycle.

[0241] In some embodiments, the update module 1703 is used to sort the rankings in the single group of rankings according to the ranking attention; in at least two update frames in the single time slice corresponding to the single group of rankings, the ranking data of different rankings in the single group of rankings are updated in sequence according to the sorting results.

[0242] In some embodiments, the update module 1703 is used to traverse the index corresponding to the ranking list in each update frame of the at least two update frames; read the ranking list identifier corresponding to the ranking list in the single group of ranking lists from the hash table according to the index; and according to the sorting result, sequentially request the ranking list data generation server to obtain the ranking list update data corresponding to the ranking list identifier in the single group of ranking lists to obtain an updated single group of ranking lists.

[0243] In some embodiments, the acquisition module 1702 is used to acquire update cycles corresponding to at least two different types of rankings among the multiple rankings, and the update cycles corresponding to different types of rankings are different.

[0244] In some embodiments, the updating module 1703 is used to respectively update the ranking data of different rankings in the at least two types of rankings in the update periods corresponding to the at least two types of rankings.

[0245] In some embodiments, the acquisition module 1702 is used to acquire ranking identifiers corresponding to the multiple rankings respectively; and classify the multiple rankings according to the ranking identifiers to obtain the at least two rankings belonging to different types.

[0246] The data cache server includes at least two sub-data cache servers; in some embodiments, the acquisition module 1702 is used to obtain the update cycles corresponding to different types of rankings in the multiple rankings cached by the first sub-data cache server.

[0247] In some embodiments, the updating module 1703 is used to synchronize the update periods corresponding to different types of ranking lists in the first sub-data cache server to the second sub-data cache server in the data cache server.

[0248] The second sub-data cache server is any sub-data cache server among the data cache servers except the first sub-data cache server.

[0249] Fig.18 The structural block diagram of a computer device 1800 shown in an exemplary embodiment of the present application is shown. The computer device can be implemented as the server in the above-mentioned solution of the present application. The image computer device 1800 includes a central processing unit (CPU) 1801, a system memory 1804 including a random access memory (RAM) 1802 and a read-only memory (ROM) 1803, and a system bus 1805 connecting the system memory 1804 and the central processing unit 1801. The image computer device 1800 also includes a large-capacity storage device 1806 for storing an operating system 1809, an application program 1810 and other program modules 1811.

[0250] The mass storage device 1806 is connected to the central processing unit 1801 through a mass storage controller (not shown) connected to the system bus 1805. The mass storage device 1806 and its associated computer readable medium provide non-volatile storage for the image computer device 1800. That is, the mass storage device 1806 may include a computer readable medium (not shown) such as a hard disk or a compact disc read-only memory (CD-ROM) drive.

[0251] Without loss of generality, the computer-readable medium may include computer storage media and communication media. Computer storage media include volatile and non-volatile, removable and non-removable media implemented by any method or technology for storing information such as computer-readable instructions, data structures, program modules or other data. Computer storage media include RAM, Erasable Programmable Read Only Memory (EPROM), Electronically-Erasable Programmable Read-Only Memory (EEPROM) flash memory or other solid-state storage technology, CD-ROM, Digital Versatile Disc (DVD) or other optical storage, cassettes, tapes, disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that the computer storage media is not limited to the above. The above-mentioned system memory 1804 and mass storage device 1806 can be collectively referred to as memory.

[0252] According to various embodiments of the present disclosure, the image computer device 1800 can also be connected to a remote computer on a network such as the Internet for operation. That is, the image computer device 1800 can be connected to a network 1808 via a network interface unit 1807 connected to the system bus 1805, or the network interface unit 1807 can be used to connect to other types of networks or remote computer systems (not shown).

[0253] The memory also includes at least one computer program, which is stored in the memory. The central processor 1801 implements all or part of the steps in the method for updating the ranking data shown in the above embodiments by executing the at least one program.

[0254] An embodiment of the present application also provides a computer device, which includes a processor and a memory, wherein the memory stores at least one program, and the at least one program is loaded and executed by the processor to implement the ranking data updating method provided by the above-mentioned method embodiments.

[0255] An embodiment of the present application further provides a computer-readable storage medium, in which at least one computer program is stored. The at least one computer program is loaded and executed by a processor to implement the ranking data updating method provided by the above-mentioned method embodiments.

[0256] An embodiment of the present application also provides a computer program product, which includes a computer program, and the computer program is stored in a computer-readable storage medium; the computer program is read and executed from the computer-readable storage medium by a processor of a computer device, so that the computer device executes to implement the ranking data updating method provided in the above-mentioned method embodiments.

[0257] It will be understood that in the specific implementation of the present application, the data involved, historical data, and data related to user data processing such as portraits related to user identity or characteristics, when the above embodiments of the present application are applied to specific products or technologies, need to obtain user permission or consent, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of relevant countries and regions.

[0258] It should be understood that the "plurality" mentioned in this article refers to two or more. "And / or" describes the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects are in an "or" relationship.

[0259] A person skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware or by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

[0260] The above description is only an optional embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent switching, improvements, etc. made within the spirit and principles of the present application shall be included in the protection scope of the present application.

Claims

1. A method for updating ranking data, characterized in that: The method is applied to a data cache server, and the method comprises: Cache the ranking data corresponding to multiple rankings; Obtaining update cycles corresponding to at least two rankings among the multiple rankings, wherein the at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; The ranking data of different rankings in the at least two rankings are updated at different time slices in the update cycle.

2. The method according to claim 1, characterized in that The at least two rankings are rankings of the same type, and the same type includes at least two sub-types; The updating of the ranking data of different rankings in the at least two rankings at different time slices in the update cycle includes: Classifying rankings of the same sub-type in the at least two rankings into the same group, to obtain at least two groups of rankings; The ranking data of different groups of rankings in the at least two groups of rankings are updated at different time slices in the update cycle.

3. The method according to claim 2, characterized in that The time slice is divided into at least two update frames, and the update frame is a sub-time slice belonging to the time slice; The updating of the ranking data of different groups of rankings in the at least two groups of rankings at different time slices in the update cycle includes: Sorting the rankings in the i-th group of rankings in the at least two groups of rankings according to the ranking popularity; In at least two update frames in the time slice corresponding to the i-th group of rankings, the rankings in the i-th group of rankings are updated in sequence according to the sorting results, where i is a positive integer.

4. The method according to claim 3, characterized in that The data cache server includes a hash table and an update management data table, the hash table is used to cache the ranking data corresponding to the multiple rankings respectively, and the update management data table is used to store the index of the ranking data in the hash table; The updating of the rankings in the i-th group of rankings in sequence according to the sorting results in at least two update frames in the time slice corresponding to the i-th group of rankings includes: Traversing the indexes corresponding to the ranking lists in each update frame of the at least two update frames; Reading a ranking list identifier corresponding to a ranking list in the i-th group of ranking lists from the hash table according to the index; According to the sorting result, the ranking data generation server is requested in sequence to obtain the ranking update data corresponding to the ranking identifier in the i-th group of rankings, so as to obtain the updated i-th group of rankings.

5. The method according to any one of claims 1 to 4, characterized in that: The at least two rankings are rankings of the same type, and the same type includes a subtype; the method further includes: Grouping rankings of the same sub-type in the at least two rankings into the same group to obtain a single group ranking; The ranking data of different rankings in the single group of rankings are updated in at least two update frames in a single time slice in the update cycle.

6. The method according to claim 5, characterized in that The updating of the ranking data of different rankings in the single group of rankings in at least two update frames in a single time slice in the update cycle includes: Sorting the rankings in the single group of rankings according to the ranking popularity; In at least two update frames in the single time slice corresponding to the single group of rankings, ranking data of different rankings in the single group of rankings are updated in sequence according to the sorting results.

7. The method according to claim 6, characterized in that In at least two update frames in the single time slice corresponding to the single group of rankings, updating ranking data of different rankings in the single group of rankings in sequence according to the sorting results includes: Traversing the indexes corresponding to the ranking lists in each update frame of the at least two update frames; Reading a ranking list identifier corresponding to a ranking list in the single group of ranking lists from a hash table according to the index; According to the sorting result, the ranking data generation server is requested in sequence to obtain the ranking update data corresponding to the ranking identifier in the single group ranking, so as to obtain an updated single group ranking.

8. The method according to any one of claims 1 to 4, characterized in that: The method further comprises: Obtaining update cycles corresponding to at least two ranking lists of different types among the multiple ranking lists, wherein the update cycles corresponding to different types of ranking lists are different; The ranking data of different rankings in the at least two types of rankings are updated respectively in the update periods corresponding to the at least two types of rankings.

9. The method according to claim 8, characterized in that Before obtaining the update periods corresponding to at least two ranking lists of different types among the plurality of ranking lists, the method further includes: Obtain ranking list identifiers corresponding to the multiple ranking lists respectively; The multiple rankings are classified according to the ranking identifiers to obtain the at least two rankings belonging to different types.

10. The method according to any one of claims 1 to 4, characterized in that: The data cache server includes at least two sub-data cache servers; the method further includes: Obtaining update cycles corresponding to ranking lists of different types among the plurality of ranking lists cached by the first sub-data cache server; Synchronizing the update periods corresponding to the different types of rankings in the first sub-data cache server to the second sub-data cache server in the data cache server; The second sub-data cache server is any sub-data cache server among the data cache servers except the first sub-data cache server.

11. A device for updating ranking data, characterized in that: The device comprises: A cache module, used to cache the ranking data corresponding to multiple rankings; An acquisition module, configured to acquire update cycles corresponding to at least two rankings among the plurality of rankings, wherein the at least two rankings correspond to the same update cycle, and the update cycle includes at least two time slices; An updating module is used to update the ranking data of different rankings in the at least two rankings at different time slices in the updating cycle.

12. A computer device, characterized in that: The computer device comprises: a processor and a memory, wherein at least one computer program is stored in the memory, and the at least one computer program is loaded and executed by the processor to implement the method for updating ranking data according to any one of claims 1 to 10.

13. A computer storage medium, characterized in that: The computer-readable storage medium stores at least one computer program, and the at least one computer program is loaded and executed by the processor to implement the method for updating ranking data according to any one of claims 1 to 10.

14. A computer program product, characterized in that The computer program product includes a computer program, which is stored in a computer-readable storage medium; the computer program is read and executed from the computer-readable storage medium by a processor of a computer device, so that the computer device executes the method for updating ranking data according to any one of claims 1 to 10.