WO2024093675A1

WO2024093675A1 - Resource sharing method and apparatus, data query method and apparatus, and server

Info

Publication number: WO2024093675A1
Application number: PCT/CN2023/125200
Authority: WO
Inventors: 梅超
Original assignee: 广州市百果园信息技术有限公司
Priority date: 2022-11-02
Filing date: 2023-10-18
Publication date: 2024-05-10
Also published as: CN115914387A

Abstract

A resource sharing method and apparatus, a data query method and apparatus, and a server. The resource sharing method comprises: when it is detected that the sharing level of a user reaches a standard, acquiring a first sharable-resource list of the user (101); determining an associated-user list of the user (102); acquiring a sharing data table of at least one associated user in the associated-user list (103), wherein the sharing data table is a data table based on a remote dictionary service (Redis) storage structure, the sharing data table carries a user identifier, and the sharing data table comprises a sharing resource identifier and a reference count corresponding to the sharing resource identifier, which reference count is used for recording the number of users that share to the user identifier a sharing resource corresponding to the sharing resource identifier; and updating the sharing data table of the at least one associated user according to at least one sharable resource in the first sharable-resource list (104).

Description

Resource sharing and data query method, device and server

This application claims priority to the Chinese patent application filed with the China Patent Office on November 2, 2022, with application number 202211363501.7, the entire contents of which are incorporated by reference into this application.

Technical Field

The present application relates to the field of data processing technology, for example, to a resource sharing method, a data query method, a resource sharing device, a data query device, a server, a computer-readable storage medium, and a computer program product.

Background technique

With the development of Internet technology, there is a demand for sharing user resources between users. When certain conditions are met between users, they can use each other's special virtual assets. For example, in the game scene, when the user's Very Important Person (VIP) level reaches a certain level, some of his game props can be shared with other teammates in the same game. For another example, in the live broadcast scene, when the friendship level reaches a certain level, some of his props (avatar frames, skin cards, room entry special effects, etc.) can be shared with friends, and some props owned by friends can also be used.

In related technologies, the method of sharing user resources between users is as follows:

Method 1: When a user obtains a resource that can be shared, the user first writes the resource into the user's own item table, and then checks whether the user has a qualified sharing friend. If so, the item information of the resource is also written into the item table of the sharing friend. In this way, when the user queries the information of the items available to him, he only needs to query the item table under his name. However, this method has a write diffusion problem, that is, if the user has multiple qualified sharing friends, the user needs to write the information of the resource into the item table of each sharing friend when obtaining the shareable resource, so that the information of the resource needs to be written in multiple copies (depending on the number of sharing friends). Although this can simplify the process when the user queries the list of available items, it also greatly causes data redundancy, resulting in problems such as an increase in the amount of data in the user's item table and slow query. It also directly leads to problems such as the trouble of recycling shared resources. For example, when a shared item is shared with a user by multiple different sharing friends, such as B, C, and D all have the same item and share it with A, even if A and B terminate the sharing relationship, A can still share the item with C and D. Therefore, the shared item information under A's name cannot be cleared at this time, so it is necessary to record the shared items from which users the item can be shared. This makes the data storage and sharing privilege recovery process very complicated.

Method 2: When a user obtains a resource that can be shared, he only writes his own item table and then uses When a user queries the information of his available items, he first checks the item table under his name, then checks whether there are any qualified sharing friends, and if so, checks the items that can be shared under the names of the sharing friends. The difference between this method and method 1 is that this method does not write the shared resources to the item table of the sharing friends, making the process of updating shared items very simple and eliminating the resource recycling process. However, this method has a read diffusion problem, that is, when a user queries his available item list, in addition to checking the items under his name, he also needs to check whether there are any qualified sharing friends, and if so, he continues to check whether there are any resources that can be shared under the names of each sharing friend. Therefore, any user needs to check the database at least 3 times (when there are no qualified sharing friends) and at most 4 times (when there are qualified sharing friends) each time he queries the available item list. The frequency of users generally querying their own item lists is much higher than the update frequency of their own item tables. Therefore, if the number of users is large and the user item information is frequently pulled under this solution, it may cause problems such as excessive database load and service jams.

Summary of the invention

The present application provides a method, device and server for resource sharing and data query, so as to solve the problems of write diffusion, read diffusion and frequent database operations existing in the related art when resources are shared among users.

The present application provides a resource sharing method, the method comprising:

When it is detected that the sharing level of the user meets the requirement, obtaining a first sharable resource list of the user;

Determine a list of associated users of the user;

Obtaining a shared data table of at least one associated user in the associated user list, wherein the shared data table is a data table based on a Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

At least one shared data table of the associated user is updated according to at least one sharable resource in the first sharable resource list.

The present application also provides a method for querying data, the method comprising:

In response to a resource query request from a user, resource data in a resource data table of the user is read, and the resource data in the resource data table read is used as first resource data;

Read the resource data in the shared data table of the user, and use the resource data in the shared data table read as the second resource data, wherein the shared data table is a data table based on the Redis storage structure, the shared data table carries the user identifier, the shared data table includes the shared resource identifier and the reference count corresponding to the shared resource identifier, and the reference count is used to record the shared resource identifier of the user. the number of users sharing the resource corresponding to the shared resource identifier;

A resource display list is generated based on the first resource data and the second resource data, and the resource display list is returned.

The embodiment of the present application also provides a resource sharing device, the device comprising:

A first sharable resource list acquisition module, configured to acquire a first sharable resource list of the user when detecting that the sharing level of the user meets the requirement;

An associated user list determination module, configured to determine an associated user list of the user;

A first shared data table acquisition module is configured to acquire a shared data table of at least one associated user in the associated user list, wherein the shared data table is a data table based on a Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The first shared data table updating module is configured to update the shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

The present application also provides a data query device, the device comprising:

A first query module is configured to respond to a resource query request of a user, read resource data in a resource data table of the user, and use the resource data in the resource data table read as first resource data;

A second query module is configured to read resource data in a shared data table of the user, and use the resource data in the shared data table read as second resource data, wherein the shared data table is a data table based on a Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, and the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The resource display list generating module is configured to generate a resource display list based on the first resource data and the second resource data, and return the resource display list.

The present application also provides a server, the server comprising:

at least one processor; and

a memory communicatively connected to the at least one processor; wherein,

The memory stores a computer program that can be executed by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute any method described in the embodiments of the present application.

The embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement any method described in the embodiment of the present application when executed.

The embodiments of the present application further provide a computer program product, which includes computer executable instructions, and the computer executable instructions are used to implement any method described in the embodiments of the present application when executed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG1 is a flow chart of a resource sharing method provided in Embodiment 1 of the present application;

FIG2 is a schematic diagram of a storage structure of a shared data table provided in Example 1 of the present application;

FIG3 is a flow chart of a resource sharing method provided in Embodiment 2 of the present application;

FIG4 is a flow chart of a resource sharing method provided in Embodiment 3 of the present application;

FIG5 is a flow chart of a resource sharing method provided in Embodiment 4 of the present application;

FIG6 is a flow chart of a resource sharing method provided in Embodiment 5 of the present application;

FIG7 is a flow chart of a resource sharing method provided in Embodiment 6 of the present application;

FIG8 is a flow chart of a data query method provided in Embodiment 7 of the present application;

FIG9 is a schematic diagram of a resource display list provided in Embodiment 7 of the present application;

FIG10 is a schematic diagram of the structure of a resource sharing device provided in Embodiment 8 of the present application;

11 is a schematic diagram of the structure of a data query device provided in Example 9 of the present application;

FIG12 is a schematic diagram of the structure of a server provided in Embodiment 10 of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application. The described embodiments are only part of the embodiments of the present application, rather than all the embodiments.

The terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. The numbers used in this way are interchangeable where appropriate so that the embodiments of the application described herein can be implemented in orders other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those listed steps or units, but may include other steps or units that are not listed or inherent to these processes, methods, products or apparatuses. Yuan.

Embodiment 1

FIG1 is a flowchart of a resource sharing method provided in Embodiment 1 of the present application, which is applied to a scenario where resources are shared between users. This embodiment can be executed by a server. As shown in FIG1 , this embodiment can include the following steps.

Step 101: when it is detected that the sharing level of a user reaches a certain level, a first sharable resource list of the user is obtained.

The user may be any user registered in the server.

Different types of sharing levels can be set according to different application scenarios. For example, a sharing level can be set for an individual user, and the user can increase the sharing level by performing specified operations; or, a sharing level can be set for an association between two users, and the sharing level can be updated based on the interaction between the two users.

The above-mentioned achievement of the standard may be achievement of a preset condition, and the preset condition may vary according to different application scenarios.

The server monitors the sharing levels of multiple users. If it detects that a user's sharing level meets the standard, it obtains the user's shareable resource list, where the shareable resource list includes one or more shareable resources. The shareable resources are different from the general resources that every user has. They refer to specific resources that can only be enjoyed after reaching a certain level. Exemplarily, the resources can be virtual resources. For example, in a live broadcast scenario, the resources can include live broadcast prop resources such as skins, room entry special effects, and avatar frames; in a game scenario, the resources can include game prop resources such as skins, game special effects, and heroes. General resources can be free resources, while shareable resources can be VIP resources.

During implementation, in the sharable resource list, each sharable resource may be represented by a resource identifier (eg, a resource identifier (IDentifier, ID), an item ID).

For the sake of distinction, in this embodiment, the sharable resource list of the user who currently meets the sharing level requirement is referred to as the first sharable resource list, and the sharable resource list of other users different from the current user may be referred to as the second sharable resource list hereinafter.

In one implementation, when it is necessary to obtain the first sharable resource list, all resources of the current user may be obtained, and sharable resources may be selected from all resources to form the first sharable resource list. Exemplarily, a corresponding resource information table may be configured for each resource in the server, and the resource information table may be cached in the memory, as shown in Table 1 below. The resource information table may include fields such as resource ID, resource type, resource name, resource icon, and whether it is sharable. In addition, the resource information table may also specify the main key Keyword (primary key):

Table 1

Whether the resource is a shareable resource can be determined based on the value of the is_shareable field of each resource. If is_shareable=1, it means that the resource is a shareable resource, and if is_shareable=0, it means that the resource is a non-shareable resource.

Step 102: Determine a list of associated users of the current user.

Among them, the associated user list may include at least one associated user. In one embodiment, the associated user may be other users who have an interactive relationship with the current user and meet the set conditions. For example, in a game scenario, the associated user may be a teammate of the current user. In a live broadcast scenario, the associated user may be a user who follows the current user or a user followed by the current user. In an instant messaging scenario, the associated user may be a friend user of the current user.

In one implementation, all users associated with the current user may be obtained, and users meeting set conditions may be selected from all users as associated users.

In other embodiments, the associated user may also be another user specified by the user, for example, the associated user may be a user selected by the current user in his or her friend list, or a user searched by the current user.

On the other hand, if the current user has no associated users that meet the set conditions, the process ends.

Step 103: Obtain a shared data table of at least one associated user in the associated user list.

The shared data table (ShareTable) is a data table based on the Remote Dictionary Server (Redis) storage structure. The Redis Hash structure can be used for data storage in the shared data table. Redis Hash is an open source key-value storage database written in ANSI C language, compliant with the Berkeley Software Distribution (BSD) protocol, supporting the network, and can be based on memory, distributed, and optionally persistent. It also provides an application program interface (Application Program Interface, API) in multiple languages. Hash is a Key-Value mapping data type supported by Redis, which is suitable for storing object type data.

In this embodiment, each shared data table carries the user ID of the corresponding associated user, and the shared data table may include a shared resource ID and a reference count corresponding to the shared resource ID, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource ID with the user ID.

For example, the storage structure of the shared data table can be shown in Figure 2. In Figure 2, the key format of the shared data table is: PREFIX_${uid}, where PREFIX is a fixed prefix and ${uid} is the unique uid of the user corresponding to the shared data table. For each shared data table, its field is the resource ID of the shared resource obtained by the uid, and the value is the reference count, which indicates how many users can provide the corresponding shared resource for the current uid. For example, in Figure 2, the reference count of item_id1 is 3, indicating that the number of users who can provide item_id1 for the current uid is 3, that is, there are 3 users who share the resource item_id1 for the current uid.

Step 104: update a shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

In the maintenance and management of the shared data table, if a user's sharing level meets the standard, the associated shared data table can be updated according to the sharable resource list of the user who meets the standard, so that at least one associated user can share the sharable resources of the current user.

In one implementation, a resource identifier of at least one sharable resource in a first sharable resource list may be obtained, and each resource identifier may be matched in a shared data table of at least one associated user; for each shared data table, if a resource identifier is successfully matched in the shared data table, a reference count corresponding to the matched shared resource identifier in the shared data table is increased by 1; if another resource identifier fails to match in the shared data table, the resource identifier is added to the shared data table as a shared resource identifier, and the reference count corresponding to the resource identifier is marked as 1.

For example, the sharable resources included in the first sharable resource list are item_id1, item_id2 and item_id8. When the shared data table of Figure 2 is updated, item_id1 and item_id2 can be matched, but item_id8 is not matched. In this case, the reference count 3 of item_id1 can be incremented by 1 to obtain a reference count of 4, and the reference count 1 of item_id2 can be incremented by 1 to obtain a reference count of 2. Item_id8 is added to the shared data table, and the reference count of item_id8 is 1.

In this embodiment, the shared resources obtained by each user are maintained through a shared data table, and the reference count of each shared resource is recorded in the shared data table. The number of users who can provide the current shared resource to the user is recorded through the reference count. When resource sharing is required, the management of shared resources is directly achieved through the reference count, without writing the shared resources into the resource data table of at least one associated user, and no additional data is added to the resource data table of at least one associated user, which reduces data redundancy and coupling between tables and avoids the problem of write diffusion. Subsequent operations such as query, update, and recycling based on shared resources are all implemented based on the reference count, making the management of shared resources as simple and efficient as possible, reducing the communication between users. The maintenance cost of shared resources is reduced, thereby improving service performance.

Exemplarily, the shared data table of this embodiment is a data table based on the Redis storage structure. Compared with the read and write operations on the database, Redis has higher read and write efficiency, which reduces the number of database read and write operations. In high concurrency scenarios, it can greatly improve service performance and reduce the pressure on the database.

When performing resource queries, only one database query (query in the resource data table) and one Redis query (query in the shared data table) are required. There is no need to query the resource data table of at least one associated user separately. The number of input/output (I/O) operations is reduced, the read diffusion problem is avoided, and the number of database operations is effectively reduced, thereby reducing the database load and improving service response efficiency.

Embodiment 2

FIG3 is a flowchart of a resource sharing method provided in Embodiment 2 of the present application. Based on the above embodiments, this embodiment describes a scenario for detecting whether the sharing level meets the requirements and determining associated users. As shown in FIG3 , this embodiment may include the following steps.

Step 201: When the relationship level between a user and one or more related users in the relationship list of the user reaches a set relationship level threshold, it is determined that the sharing level of the user meets the requirement.

Exemplarily, the relationship list may include a friend relationship list, and the relationship users are friend users who follow each other with the current user.

In the implementation, a relationship table may be maintained for each relationship in the server, as shown in Table 2. The relationship table may include fields such as relationship id, relationship initiator uid, relationship recipient uid, relationship level, relationship creation time, etc.:

Table 2

Step 202: determine the related users whose relationship level reaches the set relationship level threshold as associated users, and generate an associated user list.

For example, suppose user A and user B are friends. When their friendship level is upgraded to level 5 When the user A and user B reach the level of friend (assuming level 5 is the set friend level), it can be determined that the sharing level of user A and user B meets the standard. If user A is the current user at this time, user B is the associated user of user A. If user B is the current user at this time, user A is the associated user of user B.

For another example, assuming that the friendship levels of user A with user B, user C, and user D are all upgraded to level 5, and user A is the current user, then user B, user C, and user D are all associated users of user A, and the associated user list includes user B, user C, and user D.

Step 203: Obtain a shared data table of at least one associated user in the associated user list.

Among them, the shared data table is a data table based on the Redis storage structure, the shared data table carries a user identifier, and the shared data table may include a shared resource identifier and a corresponding reference count, and the reference count is used to record the number of users who share the shared resource corresponding to the current shared resource identifier with the user identifier.

Step 204: update at least one shared data table of the associated user according to at least one sharable resource in the first sharable resource list.

This embodiment illustrates an implementation scenario of sharing resources between users with an associated relationship. When the relationship level between two users reaches a set relationship level threshold, the shared data table of the other party can be updated according to the sharable resource list of the two users, thereby realizing sharing and management of shared resources between the two users, simplifying the difficulty of managing shared resources between users and improving service performance.

Embodiment 3

Figure 4 is a flowchart of a resource sharing method provided in Example 3 of the present application. Based on the above embodiments, this embodiment describes another scenario for detecting whether the sharing level meets the requirements and determining associated users. As shown in Figure 4, this embodiment may include the following steps.

Step 301: When the sharing level of a user reaches a set level threshold, it is determined that the sharing level of the user meets the requirement.

Step 302: taking users who have a specified association relationship with the user as associated users, and generating an associated user list.

Step 303: Obtain a shared data table of at least one associated user in the associated user list.

Among them, the shared data table is a data table based on the Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a corresponding reference count, and the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier.

Step 304: update at least one sharable resource in the first sharable resource list. A shared data table associated with users.

The difference between this embodiment and the above embodiment is that this embodiment does not need to judge the relationship level between the two users. Instead, when the sharing level of a single user reaches the set level threshold, the sharing level of the user is determined to be up to standard, and the user with a specified association relationship with the current user is directly used as an associated user. Among them, the specified association relationship can be set differently according to different application scenarios. For example, in a game scenario, the specified association relationship can be a teammate relationship. That is to say, in a game team, if the game level of a game user reaches the set level threshold, the sharable resources of the game user can be shared with other teammates. The sharing and management of shared resources between users with specified association relationships is realized, which simplifies the management difficulty of shared resources and improves service performance.

Embodiment 4

FIG5 is a flowchart of a resource sharing method provided in Embodiment 4 of the present application. Based on any of the above embodiments, this embodiment describes the process of mutual resource sharing between users. As shown in FIG5 , this embodiment may include the following steps.

Step 401: when it is detected that the sharing level of a user reaches a certain level, a first sharable resource list of the user is obtained.

Step 402: Determine a list of associated users of the user.

Step 403: Obtain a shared data table of at least one associated user in the associated user list.

Among them, the shared data table is a data table based on the Redis storage structure. The shared data table carries a user identifier. The shared data table includes a shared resource identifier and a corresponding reference count. The reference count is used to record the number of users who share the shared resource corresponding to the current shared resource identifier with the user identifier.

Step 404: update a shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

Step 405: Obtain a second sharable resource list of at least one associated user.

Step 406, obtaining the shared data table of the current user.

Step 407: update the shared data table of the current user according to the second sharable resource list of at least one associated user.

In this embodiment, in addition to updating the shared data table of associated users according to the first sharable resource list of the current user, the shared data table of the current user can also be updated according to the second sharable resource list of at least one associated user. For example, assuming that the friendship level of user A with user B and user C is upgraded to level 5, user A is the current user, and user B and user C are both associated users of user A. The relationship between each resource ID and the corresponding reference count in the current shared data table of user A is as follows: As shown in Table 3 below:

table 3

Assuming that the second sharable resource list of user B is {item_id1, item_id7}, the shared data table of user A shown in Table 3 is updated according to the second sharable resource list of user B, the reference count of item_id1 is incremented by 1, and the reference count of item_id7 is incremented by 1, and the shared data table of Table 4 is obtained:

Table 4

Assuming that the second sharable resource list of user C is {item_id2, item_id3}, the shared data table of user A shown in Table 4 is updated according to the second sharable resource list of user C, the reference count of item_id2 is incremented by 1, and a record of item_id3 is added and the reference count of item_id3 is set to 1, so as to obtain the shared data table of Table 5:

table 5

When there is more than one associated user, the second sharable resource list of each associated user is updated. To avoid errors in writing data to the shared data table of the previous user, you can use a thread lock to lock the shared data table of the current user.

In this embodiment, resource management of mutual resource sharing between two users is implemented through a shared data table, which simplifies the management process of mutual resource sharing and improves the management efficiency of resource sharing.

Embodiment 5

FIG6 is a flowchart of a resource sharing method provided in Embodiment 5 of the present application. Based on any of the above embodiments, this embodiment describes the process of adding new shared resources. As shown in FIG6 , this embodiment may include the following steps.

Step 501: when it is detected that the sharing level of a user reaches the standard, a first sharable resource list of the user is obtained.

Step 502: Determine a list of associated users of the user.

Step 503: Obtain a shared data table of at least one associated user in the associated user list.

Among them, the shared data table is a data table based on the Redis storage structure. The shared data table carries a user identifier. The shared data table may include a shared resource identifier and a corresponding reference count. The reference count is used to record the number of users who share the shared resource corresponding to the current shared resource identifier with the user identifier.

Step 504: update a shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

Step 505: When the current user obtains a new shared resource, the new shared resource is written into the resource data table of the current user.

The resource data table is a data table used to record user-owned resources, and each user-owned resource can be recorded in the resource data table in the form of a resource identifier.

The resource data table can be stored in a database, such as a MySQL database.

Step 506: Update the shared data table of at least one associated user according to the new shared resource.

Among them, the method for updating the shared data table of at least one associated user can refer to the description of step 104 in the above embodiment, that is, traverse the shared data table of each associated user, if the new shared resource exists in the shared data table of the associated user, then the reference count corresponding to the resource identifier of the new shared resource is incremented by 1; if the new shared resource does not exist in the shared data table of the associated user, then the resource identifier of the new shared resource is added to the shared data table and the reference count corresponding to the resource identifier is set to 1.

In this embodiment, when a user adds a new shared resource, the shared data table of at least one associated user is updated directly according to the newly added shared resource through Redis operation, without writing the newly added shared resource to One less resource data table associated with a user avoids the problem of write diffusion, simplifies the processing flow of newly added shared resources, improves the maintenance efficiency of shared resources, and thus better improves service performance.

Embodiment 6

FIG7 is a flowchart of a resource sharing method provided in Embodiment 6 of the present application. Based on any of the above embodiments, this embodiment describes the process of recycling shared resources. As shown in FIG7 , this embodiment may include the following steps.

Step 601: when it is detected that the sharing level of a user reaches a certain level, a first sharable resource list of the user is obtained.

Step 602: Determine a list of associated users of the user.

Step 603: Obtain a shared data table of at least one associated user in the associated user list.

Step 604: update a shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

Step 605: When an invalid resource appears in the sharable resources of the current user, a search is performed in the shared data table of at least one associated user based on the resource identifier of the invalid resource, and the reference count found is reduced by 1.

The invalid resource refers to a resource that cannot be shared. If the resource has been shared, it is necessary to recycle the resource. In this embodiment, when recycling resources, the reference count in the shared data table is directly updated. For example, the resource identifier of the invalid resource can be searched in the shared data table of at least one associated user, and the reference count in the found data record is reduced by 1.

For example, in FIG2 , if the invalid resource is item_id1, the reference count in the data record where item_id1 is located may be updated from 3 to 2.

In one embodiment, the following method may be used to detect failed resources: when the sharing level of the current user is reduced to a set level threshold, each sharable resource of the user is regarded as a failed resource.

For example, if the user's sharing level is required to be 7 when the game level is met, if the user's game level drops to 6, which is lower than the required level 7, it means that the user does not have the authority to share resources. At this time, all the user's sharable resources can be treated as invalid resources, and each invalid resource can be used one by one to update the shared data table of at least one associated user.

In another embodiment, the following method can be used to detect failed resources: when a user When the relationship level of one or more associated users is lower than the set relationship level threshold, each sharable resource of the user is regarded as an invalid resource.

For example, if the friendship level is set to 5, and the friendship level between user A and user B is reduced to 4, the friendship between the two does not meet the standard. Therefore, all sharable resources of user A can be regarded as invalid resources, and each invalid resource is used to update the shared data table of user B one by one. Similarly, all sharable resources of user B can be regarded as invalid resources, and each invalid resource is used to update the shared data table of user A one by one.

In yet another embodiment, the following method may be used to detect invalid resources: when there are expired sharable resources in the user's first sharable resource list, the expired sharable resources are treated as invalid resources.

Each sharable resource has a usage period, and if the usage period is exceeded, the corresponding shared resource expires. Exemplarily, for each sharable resource, the server can also maintain a sharable resource information table, as shown in Table 6 below. The sharable resource information table may include fields such as the user ID (uid) that owns the sharable resource, the resource ID, the resource validity period start time, the resource validity period end time, and the resource acquisition time. If the resource validity period end time of the sharable resource of the current user (uid is the uid of the current user) arrives, it means that the sharable resource has expired.

Table 6

In this embodiment, expired sharable resources may be used as invalid resources, and the shared data table of at least one associated user may be updated using the invalid resources.

Step 606: When a reference count with a value of 0 appears in the shared data table, the resource record corresponding to the reference count with a value of 0 is deleted from the shared data table.

After the reference count is decremented, if a reference count with a value of 0 appears in a shared data table, the resource record containing the reference count with a value of 0 is deleted from the shared data table.

In this embodiment, when recycling shared resources, it is only necessary to operate the reference count in the shared data table without operating the database, which greatly simplifies the resource recycling process and improves the efficiency of resource recycling. Improve the management efficiency of shared resources.

Embodiment 7

FIG8 is a flowchart of a method for data query provided in Embodiment 7 of the present application. Compared with the aforementioned embodiments, this embodiment focuses on the scenario of reading data, while the aforementioned embodiments focus on the scenario of writing data. As shown in FIG8 , this embodiment may include the following steps.

Step 701: In response to a resource query request from a user, resource data in a resource data table of the user is read, and the resource data in the resource data table read is used as first resource data.

When a user needs to query his/her available resources, he/she may initiate a resource query request on the client page. The resource query request carries the user ID of the user.

After obtaining the user ID of the current user, the resource data table corresponding to the user ID can be found in the database according to the user ID, and the resource data in the resource data table can be read, and the read resource data can be used as the first resource data. The resource data table is a data table for recording the user's own resources, and each owned resource can be recorded in the resource data table in the form of a resource ID. The first resource data can include the resource ID of the current user's own resources.

Step 702: read the resource data in the shared data table of the user, and use the resource data in the shared data table read as the second resource data.

Among them, the shared data table is a data table based on the Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier. The reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier.

After obtaining the user ID of the current user, the shared data table corresponding to the user ID can also be searched in Redis according to the user ID, and the resource data in the shared data table can be read, and the read resource data can be used as the second resource data. The second resource data can include the resource ID of the resource shared by the current user and the reference count corresponding to each resource ID.

Step 703: Generate a resource display list based on the first resource data and the second resource data, and return the resource display list.

In implementation, the resource display list is generated by fusing the first resource data and the second resource data. One implementation scheme of the fusion is: writing the first resource data and the second resource data into a pre-configured display template to generate the resource display list.

The resource display list may include each resource identifier in the first resource data and the reference count corresponding to each resource identifier, and each resource identifier in the second resource data and the reference count corresponding to each resource identifier. Reference count: If the resource identifier is a code type, the resource identifier can be converted into a resource name and then displayed, as shown in FIG9 , where the owned resource is derived from the first resource data and the shared resource is derived from the second resource data.

In this embodiment, when performing a resource query, it is sufficient to perform one database query (query in the resource data table) and one Redis query (query in the shared data table). There is no need to query the resource data table of at least one associated user separately. The number of I/O operations is reduced, the read diffusion problem is avoided, and the number of database operations is effectively reduced, thereby reducing the database load and improving service response efficiency.

At the same time, since the Redis operation performance is several orders of magnitude higher than the database operation, this embodiment can greatly improve the service performance and reduce the database pressure in high concurrency scenarios.

Embodiment 8

FIG10 is a schematic diagram of the structure of a resource sharing device provided in Embodiment 8 of the present application, which may include the following modules.

A first sharable resource list acquisition module 801, configured to acquire a first sharable resource list of the user when it is detected that the sharing level of the user meets the requirement;

An associated user list determination module 802 is configured to determine an associated user list of the user;

A first shared data table acquisition module 803 is configured to acquire a shared data table of at least one associated user in the associated user list, wherein the shared data table is a data table based on a Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The first shared data table updating module 804 is configured to update the shared data table of at least one associated user according to at least one sharable resource in the first sharable resource list.

In one embodiment, the first shared data table updating module 804 is configured to:

Get the resource identifier of each shareable resource;

Matching the resource identifier in each shared data table;

If the match is successful, the reference count corresponding to the matched shared resource identifier is increased by 1;

If the match fails, the resource identifier is added to the shared data table as a shared resource identifier, and the reference count of the resource identifier is marked as 1.

In one embodiment, the device further includes a first compliance detection module configured to:

When the relationship between the user and one or more of the relationship users in the relationship list of the user If the level reaches the set relationship level threshold, it is determined that the sharing level of the user meets the requirement.

In one embodiment, the associated user list determination module 802 is configured to:

The related users whose relationship levels reach the set relationship level threshold are determined as associated users, and an associated user list is generated.

In another embodiment, the device further includes a second compliance detection module configured to:

When the sharing level of a user reaches a set level threshold, it is determined that the sharing level of the user meets the requirement.

In another embodiment, the associated user list determination module 802 is configured to:

Users having a specified association relationship with the user are taken as associated users, and an associated user list is generated.

In one embodiment, the device may further include:

A second sharable resource list acquisition module, configured to acquire a second sharable resource list of at least one associated user;

A second shared data table acquisition module, configured to acquire the shared data table of the user;

The second shared data table updating module is configured to update the shared data table of the user according to the second sharable resource list of at least one associated user.

In one embodiment, the device may further include:

A resource data table writing module, configured to write a new shared resource into the resource data table of the user when the user obtains the new shared resource;

The newly added resource writing module is configured to update the shared data table of at least one associated user according to the new shared resource.

In one embodiment, the device may further include:

The resource recovery module is configured to search in a shared data table of at least one associated user based on the resource identifier of the failed resource when an invalid resource appears in the sharable resources of the user, and reduce the reference count found by 1; when a reference count with a value of 0 appears in the shared data table, the resource record corresponding to the reference count with a value of 0 is deleted in the shared data table.

In one embodiment, the failed resource is detected in the following manner:

When the sharing level of the user is reduced to a set level threshold, each shareable resource of the user is regarded as an invalid resource;

or,

When there is an expired sharable resource in the first sharable resource list of the user, the expired sharable resource is regarded as an invalid resource;

or,

When the relationship level between the user and one or more associated users is lower than a set relationship level threshold, each sharable resource of the user is regarded as an invalid resource.

A resource sharing device provided in an embodiment of the present application can execute a resource sharing method provided in any embodiment of the present application, and has functional modules and effects corresponding to the execution method.

Embodiment 9

FIG11 is a schematic diagram of the structure of a data query device provided in Embodiment 9 of the present application, which may include the following modules.

The first query module 901 is configured to respond to a resource query request of a user, read resource data in a resource data table of the user, and use the resource data in the resource data table read as first resource data;

The second query module 902 is configured to read the resource data in the shared data table of the user, and use the resource data in the shared data table read as the second resource data, wherein the shared data table is a data table based on the Redis storage structure, the shared data table carries the user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, and the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The resource display list generating module 903 is configured to generate a resource display list based on the first resource data and the second resource data, and return the resource display list.

A data query device provided in an embodiment of the present application can execute a data query method provided in an embodiment of the present application, and has functional modules and effects corresponding to the execution method.

Embodiment 10

FIG12 shows a schematic diagram of the structure of a server 10 that can be used to implement the method embodiment of the present application. As shown in FIG12, the server 10 includes at least one processor 11, and a storage device that is connected to the at least one processor 11 in communication, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the storage device stores one or more computer programs that can be executed by at least one processor 11, and the processor 11 can perform a variety of appropriate actions and processes according to the computer program stored in the ROM 12 or the computer program loaded from the storage unit 18 to the RAM 13. In the RAM 13, a variety of programs and data required for the operation of the server 10 can also be stored.

In some embodiments, the method in any embodiment of the present application may be implemented as a computer program. It is tangibly contained in a computer-readable storage medium, such as a storage unit 18. The storage medium may be a non-transitory storage medium. In some embodiments, part or all of the computer program may be loaded and/or installed on the server 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, the method in any embodiment of the present application described above may be executed.

In some embodiments, the method in any embodiment of the present application may be implemented as a computer program product, which includes computer executable instructions, which are used to execute the method in any embodiment of the present application described above when executed.

Claims

A resource sharing method, comprising:

When it is detected that the sharing level of the user meets the requirement, obtaining a first sharable resource list of the user;

Determine a list of associated users of the user;

Obtaining a shared data table of at least one associated user in the associated user list, wherein the shared data table is a data table based on a remote dictionary service Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The shared data table of the at least one associated user is updated according to at least one sharable resource in the first sharable resource list.
The method according to claim 1, wherein the updating of the shared data table of the at least one associated user according to the at least one sharable resource in the first sharable resource list comprises:

Get the resource identifier of each shareable resource;

Matching the resource identifier in each shared data table;

If the match is successful, the reference count corresponding to the matched shared resource identifier is increased by 1;

In the case of a matching failure, the resource identifier is added to the shared data table as a shared resource identifier, and the reference count of the resource identifier is marked as 1.
The method according to claim 1 or 2, wherein the following method is used to detect whether the sharing level of the user meets the standard:

When the relationship level between the user and one or more related users in the relationship list of the user reaches a set relationship level threshold, it is determined that the sharing level of the user meets the requirement.
The method according to claim 3, wherein determining the list of associated users of the user comprises:

The related users whose relationship levels reach the set relationship level threshold are determined as associated users, and the associated user list is generated.
The method according to claim 1, wherein after updating the shared data table of the at least one associated user according to the at least one sharable resource in the first sharable resource list, the method further comprises:

Acquire a second sharable resource list of the at least one associated user;

Obtaining the shared data table of the user;

The shared data table of the user is updated respectively according to the second sharable resource list of the at least one associated user.
The method according to claim 1, 2 or 5, further comprising:

When the user obtains a new shared resource, writing the new shared resource into the resource data table of the user;

The shared data table of the at least one associated user is updated according to the new shared resource.
The method according to claim 1, 2 or 5, further comprising:

In the case where an invalid resource appears in the sharable resources of the user, searching in the shared data table of the at least one associated user based on the resource identifier of the invalid resource, and reducing the reference count found by 1;

When a reference count with a value of 0 appears in the shared data table, a resource record corresponding to the reference count with a value of 0 is deleted from the shared data table.
The method according to claim 7, wherein the failed resource is detected in the following manner:

When the sharing level of the user is reduced to a set level threshold, each sharable resource of the user is regarded as the invalid resource;

or,

In the case where there are expired sharable resources in the first sharable resource list of the user, taking the expired sharable resources as the invalid resources;

or,

In the case that the relationship level between the user and one or more associated users is lower than a set relationship level threshold, each sharable resource of the user is used as the invalid resource.
A data query method, comprising:

In response to a resource query request from a user, resource data in a resource data table of the user is read, and the resource data in the resource data table read is used as first resource data;

Read resource data in a shared data table of the user, and use the resource data in the shared data table read as second resource data, wherein the shared data table is a data table based on a remote dictionary service Redis storage structure, the shared data table carries a user identifier, and the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, wherein the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

A resource display list is generated based on the first resource data and the second resource data, and the resource display list is returned.
A resource sharing device, comprising:

A first sharable resource list acquisition module, configured to acquire a first sharable resource list of the user when detecting that the user's sharing level meets the requirement;

An associated user list determination module, configured to determine an associated user list of the user;

a first shared data table acquisition module, configured to acquire a shared data table of at least one associated user in the associated user list, wherein the shared data table is a data table based on a remote dictionary service Redis storage structure, the shared data table carries a user identifier, the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, and the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The first shared data table updating module is configured to update the shared data table of the at least one associated user according to at least one sharable resource in the first sharable resource list.
A data query device, comprising:

A first query module is configured to respond to a resource query request of a user, read resource data in a resource data table of the user, and use the resource data in the resource data table read as first resource data;

a second query module, configured to read resource data in a shared data table of the user, and use the resource data in the shared data table read as second resource data, wherein the shared data table is a data table based on a remote dictionary service Redis storage structure, the shared data table carries a user identifier, the shared data table includes a shared resource identifier and a reference count corresponding to the shared resource identifier, and the reference count is used to record the number of users who share the shared resource corresponding to the shared resource identifier with the user identifier;

The resource display list generating module is configured to generate a resource display list based on the first resource data and the second resource data, and return the resource display list.
A server, comprising:

one or more processors;

a storage device configured to store one or more programs,

When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 9.
A computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.
A computer program product, comprising computer executable instructions, which are used to implement any one of claims 1 to 9 when executed. Law.