Label processing method and device

Abstract

The embodiment of the invention provides a label processing method and device, computer equipment, a computer readable storage medium and a computer program product, and relates to the technical field of computers. The method comprises the following steps: receiving a label failure request from a first client, wherein the label failure request is used for setting a target label to be invalid; determining whether a plurality of labels bound with a preset label classification tree comprise the target label or not; wherein the label classification tree comprises a plurality of classification nodes, and the plurality of classification nodes can be bound with the plurality of labels by a second client; and under the condition that the plurality of tags comprise the target tag, refusing to set the target tag to be in a failure state. According to the technical scheme of the embodiment of the invention, wrong operation of the first client on the label can be reduced, data consistency, logic protection and service stability of the label processing method are ensured, and resource waste and development cost increase caused by wrong operation are reduced.

Description

Technical Field

[0001] Embodiments of the present application relate to the field of computer technology, and in particular, to a method and device for tag processing, a computer device, a computer-readable storage medium, and a computer program product. Background Art

[0002] In a live broadcast scenario, an upstream service provider (such as a content review team) will assign various tags to a live broadcaster based on the broadcaster's performance (such as live broadcast content, user-reported information, etc.), such as a "fake live broadcast tag", a "product promotion tag", etc. These tags are aggregated to a tag management platform for downstream service providers (such as a traffic recommendation team, a user-reported information processing system) to query and use.

[0003] However, there is a phenomenon of decoupling between the upstream and downstream in the tag management platform. The upstream service provider can arbitrarily adjust the tags, and the downstream service provider cannot perceive the invalidation of the upstream data, resulting in easy waste of resources and increased development costs due to misoperations.

[0004] It should be noted that the above content is not necessarily prior art and is not used to limit the patent protection scope of the present application. Summary of the Invention

[0005] Embodiments of the present application provide a method and device for tag processing, a computer device, a computer-readable storage medium, and a computer program product to solve or alleviate one or more of the above technical problems.

[0006] One aspect of the embodiments of the present application provides a method for tag processing, the method including: Receiving a tag invalidation request from a first client, the tag invalidation request being used to set a target tag as invalid; Determining whether the target tag is included in a plurality of tags bound to a preset tag classification tree; wherein, the tag classification tree includes a plurality of classification nodes, and the plurality of classification nodes can be bound to the plurality of tags by a second client; In the case that the plurality of tags includes the target tag, rejecting to set the target tag as an invalid state.

[0007] Optionally, the method further includes: In the case that the plurality of tags does not include the target tag, setting the target tag as an invalid state.

[0008] Optionally, the method further includes: Receiving a tag creation request from the first client; wherein, the tag creation request includes a tagging object type, and the tagging object type includes a live broadcast room type and a live broadcast session type; When the object type to be labeled is the live - broadcast room type, generate a live - broadcast room label according to the label creation request, and the live - broadcast room label is used to label the live - broadcast room; When the object type to be labeled is the live - broadcast session type, generate a live - broadcast session label according to the label creation request, and the live - broadcast session label is used to label the live - broadcast session.

[0009] Optionally, the method further includes: Receive a labeling request from a first client; wherein, the labeling request includes a target live - broadcast room, a target live - broadcast room label, and target classification node information, and the target classification node information is used to describe a target classification node among the multiple classification nodes; According to the preset label classification tree, determine whether the target live - broadcast room label is bound to the target classification node; When the target live - broadcast room label is bound to the target classification node, generate a target label - classification combination according to the labeling request, and the target label - classification combination includes the target live - broadcast room label and the target classification node; Bind the target label - classification combination to the target live - broadcast room.

[0010] Optionally, the multiple classification nodes are in a tree - like hierarchical structure; the tree - like hierarchy includes a first - level classification node and multiple levels of lower - level classification nodes, and each level of lower - level classification nodes includes one or more classification nodes. The second client includes an administrator client with management authority; the method further includes: Receive a first - level classification node creation request from the administrator client, wherein the first - level classification node creation request includes a label object type, and the label object type includes a live - broadcast room type or a live - broadcast session type; When the label object type is the live - broadcast room type, generate a live - broadcast room first - level classification node according to the first - level classification node creation request; When the label object type is the live - broadcast session type, generate a live - broadcast session first - level classification node according to the first - level classification node creation request.

[0011] Optionally, the second client further includes a general client without management authority; the method further includes: Receive a lower - level classification node creation request from the general client; the lower - level classification node creation request includes the label object type, and the lower - level classification node creation request is associated with a corresponding first - level classification node; When the label object type is the live - broadcast room type, generate a live - broadcast room lower - level classification node according to the lower - level classification node creation request; When the label object type is the live session type, create a live session sub-classification node according to the request for creating the sub-classification node. Set the sub-classification node of the live room or the sub-classification node of the live session as the child node of the corresponding first-level classification node.

[0012] Optionally, the method further includes: Receive a label binding request from the ordinary client; wherein, the label binding request includes a target label and target classification node information, and the target classification node information is used to describe the target classification node among the multiple classification nodes; Determine whether the tagging object type of the target label is the same as the label object type of the target classification node; When the tagging object type of the target label is the same as the label object type of the target classification node, bind the target label to the target classification node.

[0013] Optionally, the method further includes: Receive a label query request from the ordinary client; wherein, the label query request includes target classification node information and a target live room, and the target classification node information is used to describe the target classification node among the multiple classification nodes; According to the label classification tree, determine multiple bound labels bound to the target classification node; Determine whether there is a target bound label among the multiple bound labels, and the target bound label is a label bound to the target live room; When there is the target bound label, return the target bound label to the ordinary client.

[0014] Optionally, the method further includes: Receive a classification query request from the ordinary client, and the classification query request includes a target live room label and a target live room; According to the preset label classification tree and the target live room label, determine a target label-classification combination bound to the target live room; Return the target label-classification combination to the ordinary client.

[0015] Another aspect of the embodiments of the present application provides a label processing device, and the device includes: A receiving module, configured to receive a label invalidation request from a first client, and the label invalidation request is used to set a target label as invalid; A determination module, configured to determine whether the target tag is included in a plurality of tags bound to a preset tag classification tree; wherein, the tag classification tree includes a plurality of classification nodes, and the plurality of classification nodes can be bound to the plurality of tags by a second client; A rejection module, configured to reject setting the target tag to an invalid state in the case that the plurality of tags include the target tag.

[0016] Another aspect of the embodiments of the present application provides a computer device, including: At least one processor; and A memory communicatively connected to the at least one processor; Wherein: the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method as described above.

[0017] Another aspect of the embodiments of the present application provides a computer-readable storage medium, in which computer instructions are stored, and when the computer instructions are executed by a processor, the method as described above is implemented.

[0018] Another aspect of the embodiments of the present application provides a computer program product, including a computer program, and when the computer program is executed by a processor, the method as described above is implemented.

[0019] The embodiments of the present application adopting the above technical solutions may include the following advantages: When a tag is bound to a node of a tag classification tree by a second client, it cannot be set to invalid by a first client. The binding of a tag means that the tag can be used. Rejecting the first client from setting the bound tag to an invalid state can reduce the incorrect operations of the first client on the tag, ensure data consistency, logical protection, and service stability during the tag processing process, and reduce resource waste and increased development costs caused by incorrect operations. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The drawings exemplarily show embodiments and form a part of the specification, and are used together with the written description of the specification to explain the exemplary implementation manners of the embodiments. The shown embodiments are only for illustrative purposes and do not limit the scope of the claims. In all the drawings, the same reference numerals refer to similar but not necessarily the same elements.

[0021] Figure 1 Schematically shows an operating environment diagram of a tag processing method according to Embodiment 1 of the present application; Figure 2 Schematically shows a flowchart of a tag processing method according to Embodiment 1 of the present application; Figure 3Schematically shows an additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 4 Schematically shows another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 5 Schematically shows yet another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 6 Schematically shows yet another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 7 Schematically shows yet another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 8 Schematically shows yet another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 9 Schematically shows yet another additional flowchart of the label processing method according to Embodiment 1 of the present application; Figure 10 Schematically shows an exemplary application flowchart of the label processing method according to Embodiment 1 of the present application; Figure 11 Schematically shows a block diagram of the label processing device according to Embodiment 2 of the present application; Figure 12 Schematically shows a schematic diagram of the hardware architecture of a computer device according to Embodiment 3 of the present application; Figure 13 Schematically shows a first client setup failure prompt diagram of the label processing method according to Embodiment 1 of the present application; Figure 14 Schematically shows the effect diagram of the additional label setup page of the label processing method according to Embodiment 1 of the present application; and Figure 15 Schematically shows the node information page effect diagram of the first-level classification node of the label processing method according to Embodiment 1 of the present application. Detailed implementation manners

[0022] In order to make the purpose, technical solutions and advantages of the present application clearer and more understandable, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present application without creative efforts belong to the scope of protection of the present application.

[0023] It should be noted that in the embodiments of the present application, the descriptions involving "first", "second", etc. are only for descriptive purposes, and cannot be construed as indicating or implying their relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include at least one such feature. Additionally, the technical solutions between various embodiments may be combined with each other, but it must be based on the ability of those of ordinary skill in the art to implement. When the combination of technical solutions results in contradictions or cannot be implemented, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection required by the present application.

[0024] In the description of the present application, it should be understood that the numerical labels before the steps do not identify the sequence of execution of the steps, but are only used to conveniently describe the present application and distinguish each step. Therefore, it cannot be construed as a limitation to the present application.

[0025] First, the following provides the term explanations involved in the present application: Relational database: It is a database management system based on the relational model. The data is organized in the form of tables, and each table is composed of rows (records) and columns (fields). The association of data is achieved through the relationships between tables (such as primary keys and foreign keys).

[0026] Non-relational database: It is a type of database that does not rely on the traditional relational model and can store and manage a large amount of unstructured or semi-structured data.

[0027] Super administrator: It is the user with the highest authority in the management system.

[0028] Tree-like hierarchical structure: It is a data organization method that organizes data in a hierarchical relationship through nodes and branches, forming a structure similar to a tree.

[0029] Secondly, to facilitate the understanding of the technical solutions provided in the embodiments of the present application by those skilled in the art, the related technologies are described below: In a live broadcast scenario, different upstream business parties (such as content review teams) can assign tags to a live streamer based on the streamer's performance over a certain period of time. The tag management platform can provide the ability to summarize tags, and then each downstream business party (such as the traffic recommendation team) can query based on the tag content they are interested in. Each time, they can query whether a specific number of live streamers have a certain specific tag at most. However, the inventor of the present application has found that in the tag management platform, the upstream output and downstream business parties are completely decoupled. The upstream output can arbitrarily adjust tags, such as setting tags to be invalid, and the downstream business parties cannot perceive the invalidation of upstream data. Moreover, the upstream tag output is relatively independent and cannot be distinguished in combination with downstream usage scenarios, resulting in multiple tags with similar meanings being produced for different scenarios. When the same downstream business party simultaneously pays attention to the usage of dozens of tags, the same batch of ten thousand rooms needs to call the tag management platform for ten queries, which places a relatively large pressure on the server and the data summary is not transparent. Moreover, each time a new tag is added, the upstream business party needs to develop and connect multiple times. When the upstream business party assigns tags, it can only target the live broadcast room and cannot target a specific live broadcast.

[0030] To this end, the embodiments of the present application provide a tag processing technical solution. In this technical solution: (1) Tags bound to a preset tag classification tree cannot be set to be invalid, which can reduce the incorrect operations of the first client on tags, thereby reducing resource waste and increased development costs caused by incorrect operations; (2) The combined use of the target live broadcast room tag and the target classification node can, while ensuring that the target live broadcast room tag is correctly applied to the target live broadcast room, expand the usage scenarios of the target live broadcast room tag and enhance the reusability of the tag; (3) The method of querying tags according to the combination of the target live broadcast room and the target classification node can, while achieving refined tag management, enable ordinary clients to quickly obtain complete and correct tag data; (4) Distinguishing between two types of tags, namely live broadcast room tags and live broadcast session tags, can facilitate marking a specific live broadcast session and expand the usage scenarios of the tags. See the following for details.

[0031] Finally, for the convenience of understanding, an exemplary operating environment is provided below.

[0032] As Figure 1 shown, the operating environment diagram includes: a server 2, a network 4, and a client 6, where: Server 2 can be composed of a single or multiple computing devices. The multiple computing devices can include virtualized computing instances. The virtualized computing instances can include virtual machines, such as emulations of computer systems, operating systems, servers, etc. The computing devices can load virtual machines based on virtual images and / or other data that define specific software (e.g., operating systems, dedicated applications, servers) for emulation. As the demand for different types of processing services changes, different virtual machines can be loaded and / or terminated on one or more computing devices. A hypervisor can be implemented to manage the use of different virtual machines on the same computing device.

[0033] Server 2 can be configured to communicate with the client 6 etc. via the network 4. The network 4 includes various network devices, such as routers, switches, multiplexers, hubs, modems, bridges, repeaters, firewalls, proxy devices, and / or the like. The network 4 can include physical links, such as coaxial cable links, twisted pair cable links, fiber optic links and their combinations, etc., or wireless links, such as cellular links, satellite links, Wi-Fi links, etc.

[0034] Server 2 can provide services such as storage, reading, writing, querying, deleting, etc., such as providing label storage, label query, and classification query services for the client.

[0035] The client 6 can be an electronic device running an operating system such as Windows, Android™, or iOS, such as a smart phone, tablet device, laptop computer, set-top box, in-vehicle terminal, smart TV. Based on the above operating systems, various application programs can be run, such as label creation programs, label offline programs, etc.

[0036] The client 6 can provide / configure a user access page for manipulating the server 2 or uploading objects, etc.

[0037] It should be noted that the above devices are exemplary, and the number and types of devices can be adjusted in different scenarios or according to different requirements.

[0038] Hereinafter, taking Server 2 as the execution subject, the technical solutions of the present application will be introduced through multiple embodiments. It should be noted that these embodiments can be implemented in various different forms and should not be construed as being limited only to the embodiments described herein.

[0039] Embodiment 1 Figure 2 A flowchart of a label processing method according to Embodiment 1 of the present application is schematically shown.

[0040] As Figure 2 shown, the label processing method can include steps S200 to S204, where: Step S200: Receive a tag invalidation request from the first client, where the tag invalidation request is used to set a target tag as invalid. Step S202: Determine whether the target tag is included in the multiple tags bound to the preset tag classification tree; wherein, the preset tag classification tree includes multiple classification nodes, and the multiple classification nodes can be bound to the multiple tags by the second client. Step S204: When the multiple tags include the target tag, reject setting the target tag to an invalid state.

[0041] When a tag is bound by the second client to a node of the tag classification tree, it cannot be set as invalid by the first client. A tag being bound means it can be used. Rejecting the first client from setting the bound tag as invalid can reduce the first client's incorrect operations on the tag, ensure data consistency, logical protection, and service stability during the server's tag processing, and reduce resource waste and increased development costs caused by misoperations.

[0042] The following combines Figure 2 to elaborate in detail on each step in steps S200 - S204 and other optional steps.

[0043] Step S200 , Receive a tag invalidation request from the first client, where the tag invalidation request is used to set a target tag as invalid.

[0044] The first client can be an upstream business party in the tag processing method and can create and use tags.

[0045] For example, in a live broadcast scenario, the first client can be a content review business party (such as a content manual review business party or a content machine review business end - party) and use tags to mark the live broadcast rooms where the live broadcast content does not comply with the platform's specifications.

[0046] In some embodiments, the target tag can be a tag for a live broadcast room or a certain live broadcast, such as a content violation tag, etc. The target tag can also be a tag for a video, audio, or graphic dynamic, such as an advertising video tag, etc.

[0047] In some embodiments, after receiving the tag invalidation request, the server 2 can first verify whether the target tag exists in a preset storage location (such as in a tag storage data table) and whether the stored target tag has already been invalidated. If the target tag does not exist or has already been invalidated, the corresponding error message can be directly returned to the first client. In other embodiments, after receiving the request from the first client, the server 2 can also verify the authorization status of the first client to ensure that only the authorized first client can initiate the tag invalidation request.

[0048] By sending a tag invalidation request, the first client can promptly clean up tags that it no longer needs (or has not been used for a long time) but are already stored in Server 2, reducing tag redundancy and improving tag processing efficiency.

[0049] Step S202 , determine whether the target tag is included among the multiple tags bound to the preset tag classification tree; wherein, the preset tag classification tree includes multiple classification nodes, and the multiple classification nodes can be bound to the multiple tags by the second client.

[0050] In some embodiments, the preset tag classification tree can be a classification tree based on different business scenarios, such as content review, traffic recommendation, user reporting, etc. In other embodiments, the preset tag classification tree can also be a classification tree based on tag attributes, such as tag type, tag level, tag validity period, etc. The multiple classification nodes of the preset tag classification tree can form a multi-level tree-like classification structure, such as first-level classification, second-level classification, third-level classification, etc.

[0051] In some embodiments, the preset tag classification tree can be stored in a relational database or a non-relational database. It can also be stored in a file system or cached in memory.

[0052] In some embodiments, all nodes of the preset tag classification tree can be queried by means of recursive query to determine whether there is a target tag. In other embodiments, an index (such as tag name, classification name) can also be established for the preset tag classification tree, or the tag name or classification node name can be fuzzy matched to improve query efficiency.

[0053] In some embodiments, the second client can be the management party of the tags, and the management party can include various roles such as super administrators. In other embodiments, the second client can also be a downstream business party in the tag processing link and can carry out work according to the usage situation of the tags. For example, in a live broadcast scenario, it can be a traffic recommendation business party and determine the traffic recommendation intensity for a live broadcast room based on the tag marking situation of the live broadcast room.

[0054] In this embodiment, managing the bound tags through the preset tag classification tree can improve the efficiency and transparency of tag processing.

[0055] Step S204 , in the case where the multiple tags include the target tag, reject setting the target tag to an invalid state.

[0056] In some embodiments, after rejecting the setting of the target label to the invalid state, a failure prompt for setting can be directly returned to the first client. In other embodiments, the reason why the label cannot be invalidated can also be returned to the first client, such as which node of the preset label classification tree the target label is bound to, which second client bound it, etc., and a solution example is provided. Figure 13 It is an exemplary diagram of a failure prompt for the first client to set.

[0057] In some embodiments, when the multiple labels do not include the target label, the setting of the target label to the invalid state can also be rejected. For example, the usage frequency of the target label in the classification tree is higher than the preset value, the first client does not meet the adjustment permission of the target label, etc.

[0058] In some embodiments, a manual confirmation link can also be set. For example, when some special labels are not bound to the preset label classification tree, they still need to be manually confirmed before they can be set to invalid.

[0059] In this embodiment, the label bound to the preset label classification tree is not set to the invalid state. The label being bound means that the label can be used or is being used. Rejecting the first client from setting the bound label to the invalid state can reduce the incorrect operations of the first client on the label, thereby ensuring data consistency, logical protection, and business stability of the label processing, and reducing resource waste and increased development costs caused by misoperations.

[0060] The foregoing has introduced the solution for rejecting the label invalidation request when the multiple labels include the target label.

[0061] The following provides an exemplary processing solution when the multiple labels do not include the target label.

[0062] In an alternative embodiment, the method further includes: When the multiple labels do not include the target label, set the target label to the invalid state.

[0063] After setting the target label to the invalid state, the corresponding attribute value of the target label in the cache can be updated. In some embodiments, the specific invalidation range of the target label can be set, such as the invalidation time, invalidation scenario, etc. An automatic invalidation policy can also be set according to the usage frequency of the label or business requirements. For example, labels that have not been queried or used for more than 30 days are automatically invalidated.

[0064] In some embodiments, after setting the target label to the invalid state, a notification can be sent to the relevant business parties (such as the second client, etc.) to ensure that the business parties can promptly perceive the change in the label state. A log record of the invalidation operation of the target label can also be made after setting the target label to the invalid state, which is convenient for auditing and tracing back.

[0065] When the target tag is not bound to the preset tag classification tree, the server can respond to the tag invalidation request and set the target tag to the invalid state. In this way, unused or expired tags can be cleared according to the request of the first client, ensuring that the use and management of tags meet the business requirements and improving the simplicity and reliability of tag management.

[0066] The foregoing introduced how to set the target tag to the invalid state. The following introduces an exemplary tag creation method.

[0067] In an alternative embodiment, as Figure 3 shown, the method further includes: S300, receiving a tag creation request from the first client; wherein, the tag creation request includes a tagging object type, and the tagging object type includes a live room type and a live session type.

[0068] S302, when the tagging object type is the live room type, generating a live room tag according to the tag creation request, where the live room tag is used to mark the live room.

[0069] S304, when the tagging object type is the live session type, generating a live session tag according to the tag creation request, where the live session tag is used to mark the live session.

[0070] For example, if the tagging object type in the tag creation request of the first client is the live room type, a live room tag A can be created, and the first client can use the live room tag A to mark the live room with room ID 00001. Another example, if the tagging object type in the tag creation request of the first client is the live session type, a live session tag B can be created, and the first client can use the live session tag B to mark the live session of the live room with room ID 00001 from 20:00 to 21:00 on January 1, 2023.

[0071] In some embodiments, the tag creation request may also include a tag description, name, etc., and may also include tag attributes, etc. For example, for the clarity tag, specific clarity values corresponding to different levels of clarity tags can be set (such as 1080P, 2K, 4K, etc.). When updating a tag with tag attributes, the tag attribute value can be directly adjusted without rebinding a new tag. Figure 14 is an exemplary schematic diagram of a new tag setting page.

[0072] In some embodiments, the tagging object type may further include an audio-video type, a user type, a commodity type, etc.

[0073] In this embodiment, when the first client creates a label, it is necessary to specify the usage scenario of the label. Distinguishing between two types of labels, namely live room labels and live session labels, can facilitate the marking of a specific live session, expand the usage scenarios of the labels, meet diverse business requirements, and improve the flexibility of label processing.

[0074] In addition to creating new labels, the created labels can also be used to mark the live room or live session. The following provides an exemplary marking method.

[0075] In an alternative embodiment, as Figure 4 shown, the method includes: S400, receiving a tagging request from the first client; wherein, the tagging request includes a target live room, a target live room label, and target classification node information, and the target classification node information is used to describe the target classification node among the multiple classification nodes.

[0076] S402, determining whether the target live room label is bound to the target classification node according to the preset label classification tree.

[0077] S404, when the target live room label is bound to the target classification node, generating a target label-classification combination according to the tagging request, where the target label-classification combination includes the target live room label and the target classification node.

[0078] S406, binding the target label-classification combination to the target live room.

[0079] For example, when the first client discovers that the live room with room ID 00001 is currently playing a horror movie, it can use the horror scene label bound to the human review screen violation node on the preset label classification tree to mark this live room. It should be noted that for the label marking of the live session, a similar method can also be adopted to mark it with the corresponding live session label.

[0080] In some embodiments, when the target live room label is not bound to the target classification node, a failure result and modification suggestions can be returned to the first client.

[0081] In some embodiments, when receiving the tagging request, the request parameters can also be verified and checked, such as verifying whether the target live room label is valid, whether the target live room exists, and whether the target classification node exists. In other embodiments, the permissions of the first client can also be verified to determine that the first client initiating the tagging request has the permission to use the target live room label and mark the target live room.

[0082] In some embodiments, after binding the target tag-classification combination to the target live streaming room, the first client may be notified that the tagging has been successfully completed, and the host and audience of the target live streaming room may be notified that the target live streaming room has been bound by the target tag-classification combination.

[0083] In a live streaming scenario, if the first client cannot create tags in combination with the specific usage scenario of the second client, it is easy to create multiple tags with similar meanings. For example, as the first client, the content review team may create two tags, namely manual review negative live stream and machine review negative live stream, according to different review methods (machine review and manual review). However, when the traffic recommendation team, as the second client, adjusts the traffic based on these two tags, the actual tag meanings of the two tags obtained by querying are both "there is a negative live streaming phenomenon in the tagged live streaming room".

[0084] In view of this, the server 2 may tag the target live streaming room through a specific target tag-classification combination. The combined use of the target live streaming room tag and the target classification node can, while ensuring that the target live streaming room tag can be correctly applied to the target live streaming room, reduce the information volume of the target live streaming room tag, thereby expanding the usage scenarios of the target live streaming room tag, enhancing the reusability of the tag, reducing the repeated creation of similar tags, and improving the resource utilization efficiency in the tag processing process.

[0085] The above describes the process of creating tags and tagging the live streaming room based on the request of the first client.

[0086] Based on the request of the second client, various operations can also be realized. Several exemplary operations are provided below.

[0087] Operation 1. In an alternative embodiment, the multiple classification nodes are in a tree-like hierarchical structure; the tree-like hierarchy includes a first-level classification node and multiple levels of subordinate classification nodes, and each level of subordinate classification nodes includes one or more classification nodes. The second client includes an administrator client with management authority. As Figure 5 shown, the method further includes: S500, receiving a first-level classification node creation request from the administrator client, where the first-level classification node creation request includes a tag object type, and the tag object type includes a live streaming room type or a live streaming session type.

[0088] S502, in the case where the tag object type is the live streaming room type, generating a live streaming room first-level classification node according to the first-level classification node creation request.

[0089] S504, in the case where the tag object type is the live streaming session type, generating a live streaming session first-level classification node according to the first-level classification node creation request.

[0090] In some embodiments, the tag object types may further include user types (tags for live streamers or audiences), product types (product tags for live commerce), event types (specific events in the live stream, such as lucky draws, interactions, etc.).

[0091] In some embodiments, after generating the first-level classification nodes, the administrator client may also set multiple second clients without management permissions as the node responsible persons. As the second client acting as the node responsible person, it can continue to create subordinate classification nodes below the first-level classification node it is responsible for.

[0092] In some embodiments, the generated first-level classification nodes can also be verified. For example, check whether the classification node names are unique and whether they conform to the naming specifications. After the first-level classification nodes are generated, relevant tags can also be automatically recommended according to the types or descriptions of the first-level classification nodes. Figure 15 An exemplary schematic diagram of the node information of the first-level classification node is shown.

[0093] In this embodiment, by creating different types of first-level classification nodes, flexible configuration and expansion of tag classification can be achieved, supporting the differentiated management requirements of different business scenarios (such as live rooms and live sessions), and improving the business expansion efficiency of tag processing.

[0094] In addition to the first-level classification nodes, the preset tag classification tree also includes multiple layers of subordinate classification nodes. The following Operation 2 takes creating a sub-node of a first-level classification node as an example to provide an exemplary method for creating subordinate classification nodes. It should be noted that for the other layers of subordinate classification nodes except the sub-nodes of the first-level classification nodes, such as the grandchild nodes of the first-level classification nodes, etc., similar creation methods can also be used for creation.

[0095] Operation 2. The second client also includes ordinary clients without management permissions, such as Figure 6 As shown, the method further includes: S600, receiving a subordinate classification node creation request from the ordinary client; the subordinate classification node creation request includes the tag object type, and the subordinate classification node creation request is associated with a corresponding first-level classification node.

[0096] S602, when the tag object type is the live room type, generating a live room subordinate classification node according to the subordinate classification node creation request.

[0097] S604, when the tag object type is the live session type, generating a live session subordinate classification node according to the subordinate classification node creation request.

[0098] S606, set the sub-classification node of the live broadcast room or the sub-classification node of the live broadcast session as the child node of the corresponding first-level classification node.

[0099] In some embodiments, the ordinary client can be the node person in charge under the corresponding first-level classification node. At this time, the ordinary client can only create sub-classification nodes under the corresponding first-level classification node and cannot create sub-classification nodes in the remaining first-level classification nodes. In other embodiments, the ordinary client can also specify other second clients as the co-maintainers of the created sub-classification nodes to jointly maintain the functions and settings of the sub-classification nodes.

[0100] In some embodiments, the ordinary client can also specify certain special attributes or rules of the sub-classification node in the sub-classification node creation request, such as whether to allow binding specific types of tags, or whether to have certain special permission settings, etc. In other embodiments, the ordinary client can also manage the generated sub-classification nodes, such as modifying the attributes of the sub-classification node, moving the position of the sub-classification node, deleting the sub-classification node, etc.

[0101] In this embodiment, the ordinary client can create sub-classification nodes under the first-level classification node, which can expand the application scenarios of the preset tag classification tree and improve the applicability and flexibility of the tag processing method. At the same time, setting different tag object types for the sub-classification nodes can clearly distinguish the usage objects of the sub-classification nodes and improve the pertinence of tag processing.

[0102] In addition to creating sub-classification nodes, the ordinary client can also bind tags to the classification nodes of the preset tag classification tree.

[0103] The following Operation Three provides an exemplary tag binding method.

[0104] Operation Three. In an alternative embodiment, as Figure 7 shown, the method further includes: S700, receive a tag binding request from the ordinary client; wherein, the tag binding request includes a target tag and target classification node information, and the target classification node information is used to describe the target classification node among the multiple classification nodes.

[0105] S702, determine whether the tagging object type of the target tag is the same as the tag object type of the target classification node.

[0106] S704, when the tagging object type of the target tag is the same as the tag object type of the target classification node, bind the target tag to the target classification node.

[0107] For example, if an ordinary client requests to bind a horror scene label with a marking object type of live broadcast room to a picture violation node I1 with a label object type of live broadcast session, the request will be rejected; If an ordinary client requests to bind a horror scene label with a marking object type of live broadcast room to a picture violation node I2 with a label object type of live broadcast room, the binding can be successful; In some embodiments, when the marking object type of the target label is different from the label object type of the target classification node, a failure result and modification suggestions can be returned to the ordinary client.

[0108] In some embodiments, the ordinary client for label binding can be the node person in charge designated by the administrator client or the co-maintainer designated by the node person in charge. At this time, it can be verified whether the ordinary client initiating the label binding request is the node person in charge or the co-maintainer after receiving the label binding request.

[0109] In some embodiments, before binding a label, it can be verified whether the permission levels of the target label and the target classification node are equal. In other embodiments, the preset label classification tree can also be updated after the label binding is completed.

[0110] In this embodiment, the binding can be completed only when the marking object type of the target label is the same as the label object type of the target classification node. Ensuring that the types of the label and the classification node are the same can prevent the label from being wrongly bound to classification nodes in different usage scenarios (such as live broadcast rooms or live broadcast sessions), avoid confusion in business logic, and ensure the semantic consistency of the preset label classification tree, improving the stability and maintainability of label processing.

[0111] The ordinary client can also query the labels bound in the preset label classification tree. The following operation four provides an exemplary label query method.

[0112] Operation Four. In an alternative embodiment, as Figure 8 shown, the method further includes: S800, receiving a label query request from the ordinary client; wherein, the label query request includes target classification node information and a target live broadcast room, and the target classification node information is used to describe the target classification node among the multiple classification nodes.

[0113] S802, determining, according to the label classification tree, multiple bound labels bound to the target classification node.

[0114] S804, determining whether a target bound label exists among the multiple bound labels, where the target bound label is a label bound to the target live broadcast room.

[0115] S806. When the target binding label exists, return the target binding label to the general client.

[0116] In some embodiments, the binding relationship between the frequently queried target binding label and the target classification node can be saved in a cache to reduce the number of database queries.

[0117] In some embodiments, after a successful query, server 2 can return the detailed information of this query to the general client, such as the effective status of the target binding label, other labels or recommended labels related to the target classification node, etc. In other embodiments, when the query fails, that is, when the target binding label does not exist, a failure result and related suggestions, such as recommended classification nodes or related classifications, can also be returned to the general client.

[0118] It should be noted that for the label query of live broadcast sessions, a method similar to Operation Four can also be used, and the labels of the corresponding live broadcast sessions can be used for query, which will not be elaborated here.

[0119] The general client can send a label query request to server 2 to query which target binding labels are used to mark the target live broadcast room under the target classification node. By performing label queries based on the combination of the target live broadcast room and the target classification node, while achieving refined label management, the general client can quickly obtain complete and correct label marking data, improving the efficiency and flexibility of the query and enhancing the efficiency of label processing.

[0120] In addition to querying the labels bound in the preset label classification tree, the general client can also query in which different classifications the target live broadcast room is bound with the same label. The following Operation Five provides an exemplary classification query method.

[0121] Operation Five. In an alternative embodiment, as Figure 9 shown, the method further includes: S900. Receive a classification query request from the general client, where the classification query request includes the target live broadcast room label and the target live broadcast room; S902. Determine the target label-classification combination bound to the target live broadcast room according to the preset label classification tree and the target live broadcast room label; S904. Return the target label-classification combination to the general client.

[0122] In some embodiments, each classification query request may contain only one target live room tag and one target live room. In other embodiments, each classification query request may also contain multiple target live room tags or multiple target live rooms. In still other embodiments, the classification query request may further contain a query time range to query the binding situation of the target live room tags within the query time range.

[0123] In some embodiments, the target tag-classification combination may include the target live room tag and the detailed information of multiple classification nodes bound to the target live room tag. Different query results may also be returned according to the permission level of the ordinary client. For example, a low-permission ordinary client can only see the classification node names, while a high-permission ordinary client can see the detailed information of the classification nodes.

[0124] It should be noted that when performing a classification query for a live session, a method similar to Operation 5 can also be used, which will not be elaborated here.

[0125] In this embodiment, the ordinary client can send a classification query request to Server 2 to query at one time in which different classifications the target live room is bound with the same tag, without querying all classification nodes one by one, improving the query speed and efficiency, reducing the server pressure, and helping to enhance the efficiency and transparency of the tag processing method.

[0126] To make the present application easier to understand, the following is combined with Figure 10 to provide an exemplary application. Wherein: S11, the super administrator (i.e., the administrator client) creates a root node (i.e., a first-level classification node) for the tag classification tree for the live scene (i.e., the preset tag classification tree), and sets the node person in charge O1 (i.e., the ordinary client); S12, the node person in charge O1 creates multiple levels of subordinate classification nodes in the tag classification tree, and sets the node person in charge and co-maintainers for each subordinate classification node; S13, according to the tag creation request of the upstream business party (i.e., the first client), a tag T1 of the tag object type of the live room is created; S14, the node person in charge O1 binds the tag T1 to a subordinate classification node P1 of the tag object type of the live room; S15, the upstream business party requests to take the tag T1 offline and sets the status of the tag T1 to invalid; S16, querying the tag classification tree to obtain that the tag T1 is being bound to the subordinate classification node P1, and rejecting the offline request of the upstream business party; S17, the upstream business party requests to take the tag T2 offline and sets the status of the tag T2 to invalid; S18. Query the tag classification tree and find that tag T2 is not bound to any classification node, then take tag T2 offline. S19. According to the tagging request from the upstream business party, use tag T1 on the lower-level classification node P1 to mark the live broadcast room with room ID 00001. S20. Node person in charge O1 queries the server according to the lower-level classification node P1 and room ID: 00001 to find out which tags are marked on the live broadcast room with room ID 00001 (i.e., the target live broadcast room) on the lower-level classification node P1 (i.e., the target classification node). S21. Return the query result to node person in charge O1. The live broadcast room with room ID 00001 is marked with tag T1 and tag T3 on the lower-level classification node P1. S22. Node person in charge O1 queries the server according to room ID: 00001 and tag T3 to find out on which classification nodes the live broadcast room with room ID 00001 is marked with tag T3 (i.e., the target live broadcast room tag). S23. Return the query result to node person in charge O1. The live broadcast room with room ID 00001 is marked with tag T3 on the lower-level classification node P1 and the lower-level classification node P2.

[0127] Embodiment 2 Figure 11 Schematically shows a block diagram of a tag processing device according to Embodiment 2 of the present application. The device can be divided into one or more program modules. One or more program modules are stored in a storage medium and executed by one or more processors to complete the embodiments of the present application. The program modules referred to in the embodiments of the present application refer to a series of computer program instruction segments that can complete specific functions. The following description will specifically introduce the functions of each program module in this embodiment. As Figure 11 shown, the device 1000 may include: a receiving module 1100, a determining module 1200, and a rejecting module 1300, where: The receiving module 1100 is configured to receive a tag invalidation request from a first client, where the tag invalidation request is used to set a target tag to be invalid. The determining module 1200 is configured to determine whether the target tag is included in a plurality of tags bound to a preset tag classification tree; where the tag classification tree includes a plurality of classification nodes, and the plurality of classification nodes can be bound to the plurality of tags by a second client. The rejecting module 1300 is configured to reject setting the target tag to an invalid state when the plurality of tags include the target tag.

[0128] As an optional embodiment, the device 1000 further includes a tag invalidation module, configured to: In the case that the target label is not included in the multiple labels, set the target label to an invalid state.

[0129] As an optional embodiment, the apparatus 1000 further includes a label creation module for: Receiving a label creation request from the first client; wherein, the label creation request includes a tagging object type, and the tagging object type includes a live room type and a live session type; In the case that the tagging object type is the live room type, generating a live room label according to the label creation request, and the live room label is used to mark the live room; In the case that the tagging object type is the live session type, generating a live session label according to the label creation request, and the live session label is used to mark the live session.

[0130] As an optional embodiment, the apparatus 1000 further includes a tagging module for: Receiving a tagging request from the first client; wherein, the tagging request includes a target live room, a target live room label, and target classification node information, and the target classification node information is used to describe a target classification node among the multiple classification nodes; Determining, according to the preset label classification tree, whether the target live room label is bound to the target classification node; In the case that the target live room label is bound to the target classification node, generating a target label-classification combination according to the tagging request, and the target label-classification combination includes the target live room label and the target classification node; Binding the target label-classification combination to the target live room.

[0131] As an optional embodiment, the multiple classification nodes are in a tree-like hierarchical structure; the tree-like hierarchy includes a first-level classification node and multiple levels of lower-level classification nodes, each level of lower-level classification nodes includes one or more classification nodes, and the second client includes an administrator client with management authority; the apparatus 1000 further includes a first-level classification node creation module for: Receiving a first-level classification node creation request from the administrator client, wherein the first-level classification node creation request includes a label object type, and the label object type includes a live room type or a live session type; In the case that the label object type is the live room type, generating a live room first-level classification node according to the first-level classification node creation request; In the case that the label object type is the live session type, generating a live session first-level classification node according to the first-level classification node creation request.

[0132] As an alternative embodiment, the second client further includes a general client without management authority; the apparatus 1000 further includes a subordinate classification node creation module for: Receiving a subordinate classification node creation request from the general client; the subordinate classification node creation request includes the tag object type, and the subordinate classification node creation request is associated with a corresponding first-level classification node; When the tag object type is a live broadcast room type, generating a live broadcast room subordinate classification node according to the subordinate classification node creation request; When the tag object type is a live broadcast session type, generating a live broadcast session subordinate classification node according to the subordinate classification node creation request; Setting the live broadcast room subordinate classification node or the live broadcast session subordinate classification node as a child node of the corresponding first-level classification node.

[0133] As an alternative embodiment, the apparatus 1000 further includes a tag binding module for: Receiving a tag binding request from the general client; wherein, the tag binding request includes a target tag and target classification node information, and the target classification node information is used to describe a target classification node among the multiple classification nodes; Determining whether the tagging object type of the target tag is the same as the tag object type of the target classification node; When the tagging object type of the target tag is the same as the tag object type of the target classification node, binding the target tag to the target classification node.

[0134] As an alternative embodiment, the apparatus 1000 further includes a tag query module for: Receiving a tag query request from the general client; wherein, the tag query request includes target classification node information and a target live broadcast room, and the target classification node information is used to describe a target classification node among the multiple classification nodes; Determining, according to the tag classification tree, multiple bound tags bound to the target classification node; Determining whether a target bound tag exists among the multiple bound tags, where the target bound tag is a tag bound to the target live broadcast room; When the target bound tag exists, returning the target bound tag to the general client.

[0135] As an alternative embodiment, the apparatus 1000 further includes a classification query module for: Receiving a classification query request from the general client, where the classification query request includes a target live broadcast room tag and a target live broadcast room; Determine a target tag-classification combination bound to the target live broadcast room according to the preset tag classification tree and the target live broadcast room tag; Return the target tag-classification combination to the general client.

[0136] Embodiment III Figure 12 Schematically shows a hardware architecture diagram of a computer device 10000 suitable for implementing the tag processing method according to Embodiment III of the present application. In some embodiments, the computer device 10000 may be a terminal device such as a smart phone, a wearable device, a tablet computer, a personal computer, a vehicle-mounted terminal, a game console, a virtual device, a workbench, a digital assistant, a set-top box, a robot, etc. In other embodiments, the computer device 10000 may be a rack-mounted server, a blade server, a tower server, or a cabinet server (including an independent server or a server cluster composed of multiple servers). As Figure 12 shown, the computer device 10000 includes, but is not limited to: a memory 10010, a processor 10020, and a network interface 10030 that can be communicatively linked to each other through a system bus. Among them: The memory 10010 includes at least one type of computer-readable storage medium. The readable storage medium includes flash memory, a hard disk, a multimedia card, a card-type memory (such as an SD or DX memory), a random access memory (RAM), a static random access memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the memory 10010 may be an internal storage module of the computer device 10000, such as the hard disk or memory of the computer device 10000. In other embodiments, the memory 10010 may also be an external storage device of the computer device 10000, such as a plug-in hard disk equipped on the computer device 10000, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc. Of course, the memory 10010 may also include both the internal storage module and the external storage device of the computer device 10000. In this embodiment, the memory 10010 is generally used to store the operating system and various application software installed on the computer device 10000, such as the program code of the tag processing method. In addition, the memory 10010 may also be used to temporarily store various data that have been output or will be output.

[0137] The processor 10020 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other chips in some embodiments. The processor 10020 is generally used to control the overall operation of the computer device 10000, such as performing control and processing related to data interaction or communication with the computer device 10000. In this embodiment, the processor 10020 is used to run the program code stored in the memory 10010 or process data.

[0138] The network interface 10030 may include a wireless network interface or a wired network interface. The network interface 10030 is generally used to establish a communication link between the computer device 10000 and other computer devices. For example, the network interface 10030 is used to connect the computer device 10000 to an external terminal through a network, and establish a data transmission channel and a communication link between the computer device 10000 and the external terminal. The network may be an intranet, the Internet, the Global System of Mobile communication (GSM for short), Wideband Code Division Multiple Access (WCDMA for short), 4G network, 5G network, Bluetooth, Wi-Fi and other wireless or wired networks.

[0139] It should be noted that Figure 12 Only the computer device with components 10010 - 10030 is shown, but it should be understood that it is not required to implement all the shown components, and more or fewer components may be alternatively implemented.

[0140] In this embodiment, the label processing method stored in the memory 10010 may also be divided into one or more program modules and executed by one or more processors (such as the processor 10020) to complete the embodiments of the present application.

[0141] Embodiment 4 The embodiments of the present application further provide a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the label processing method in the embodiments are implemented.

[0142] In this embodiment, the computer-readable storage medium includes flash memory, hard disks, multimedia cards, card-type memories (such as SD or DX memories, etc.), random access memories (RAM), static random access memories (SRAM), read-only memories (ROM), electrically erasable programmable read-only memories (EEPROM), programmable read-only memories (PROM), magnetic memories, magnetic disks, optical disks, etc. In some embodiments, the computer-readable storage medium may be an internal storage unit of a computer device, such as the hard disk or memory of the computer device. In other embodiments, the computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc., equipped on the computer device. Of course, the computer-readable storage medium may also include both the internal storage unit and the external storage device of the computer device. In this embodiment, the computer-readable storage medium is generally used to store the operating system installed on the computer device and various application software, such as the program code of the label processing method in the embodiment. In addition, the computer-readable storage medium may also be used to temporarily store various data that have been output or will be output.

[0143] Embodiment 5 The embodiment of the present application further provides a computer program product, including a computer program, which implements the method in the above embodiment when executed by a processor.

[0144] Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the embodiments of the present application can be implemented by a general-purpose computer device. They can be concentrated on a single computer device or distributed on a network composed of multiple computer devices. Optionally, they can be implemented by program codes executable by the computer device. Thus, they can be stored in a storage device and executed by the computer device. And in some cases, the steps shown or described can be executed in a different order than here, or they can be separately fabricated into individual integrated circuit modules, or multiple modules or steps among them can be fabricated into a single integrated circuit module to be implemented. In this way, the embodiments of the present application are not limited to any specific combination of hardware and software.

[0145] It should be noted that the above are only the preferred embodiments of the present application, and do not limit the patent protection scope of the present application. Any equivalent structure or equivalent process transformation made by using the content of the specification and drawings of the present application, or directly or indirectly applied in other related technical fields, shall be equally included in the patent protection scope of the present application.

Claims

1. A label processing method, characterized in that, The method includes: Receiving a tag invalidation request from a first client, where the tag invalidation request is used to set a target tag to be invalid; Determining whether the target tag is included in multiple tags bound to a preset tag classification tree; wherein, the tag classification tree includes multiple classification nodes, and the multiple classification nodes can be bound to the multiple tags by a second client; When the multiple tags include the target tag, rejecting to set the target tag to an invalid state.

2. The method according to claim 1, wherein The method further includes: When the multiple tags do not include the target tag, setting the target tag to an invalid state.

3. The method according to claim 1, wherein The method further includes: Receiving a tag creation request from the first client; wherein, the tag creation request includes a tagging object type, and the tagging object type includes a live room type and a live session type; When the tagging object type is the live room type, generating a live room tag according to the tag creation request, where the live room tag is used to mark the live room; When the tagging object type is the live session type, generating a live session tag according to the tag creation request, where the live session tag is used to mark the live session.

4. The method according to claim 3, wherein The method further includes: Receiving a tagging request from a first client; wherein, the tagging request includes a target live room, a target live room tag, and target classification node information, and the target classification node information is used to describe a target classification node among the multiple classification nodes; Determining whether the target live room tag is bound to the target classification node according to the preset tag classification tree; When the target live room tag is bound to the target classification node, generating a target tag-classification combination according to the tagging request, where the target tag-classification combination includes the target live room tag and the target classification node; Binding the target tag-classification combination to the target live room.

5. The method according to claim 3, wherein The multiple classification nodes are in a tree-like hierarchical structure; the tree-like hierarchy includes a first-level classification node and multiple levels of lower-level classification nodes, and each level of lower-level classification nodes includes one or more classification nodes. The second client includes an administrator client with management authority; the method further includes: Receiving a first-level classification node creation request from the administrator client, where the first-level classification node creation request includes a tag object type, and the tag object type includes a live room type or a live session type; When the tag object type is the live room type, generating a live room first-level classification node according to the first-level classification node creation request; When the tag object type is the live session type, generating a live session first-level classification node according to the first-level classification node creation request.

6. The method according to claim 5, characterized in that, The second client further includes a general client without management authority; the method further includes: Receiving a lower-level classification node creation request from the general client; the lower-level classification node creation request includes the tag object type, and the lower-level classification node creation request is associated with a corresponding first-level classification node; When the label object type is the live room type, create a sub-classification node of the live room according to the sub-classification node creation request; When the label object type is the live session type, create a sub-classification node of the live session according to the sub-classification node creation request; Set the sub-classification node of the live room or the sub-classification node of the live session as a child node of the corresponding first-level classification node.

7. The method according to claim 6, wherein The method further includes: Receiving a label binding request from the ordinary client; wherein, the label binding request includes a target label and target classification node information, and the target classification node information is used to describe a target classification node among the multiple classification nodes; Determine whether the tagging object type of the target label is the same as the label object type of the target classification node; When the tagging object type of the target label is the same as the label object type of the target classification node, bind the target label to the target classification node.

8. The method according to claim 6, characterized in that, The method further includes: Receiving a label query request from the ordinary client; wherein, the label query request includes target classification node information and a target live room, and the target classification node information is used to describe a target classification node among the multiple classification nodes; According to the label classification tree, determine multiple bound labels bound to the target classification node; Determine whether a target bound label exists among the multiple bound labels, and the target bound label is a label bound to the target live room; When the target bound label exists, return the target bound label to the ordinary client.

9. The method according to claim 6, wherein The method further includes: Receiving a classification query request from the ordinary client, the classification query request including a target live room label and a target live room; According to the preset label classification tree and the target live room label, determine a target label-classification combination bound to the target live room; Return the target label-classification combination to the ordinary client.

10. A label processing device, characterized in that, The device includes: A receiving module, configured to receive a label invalidation request from a first client, and the label invalidation request is used to set a target label to be invalid; A determination module, configured to determine whether the target label is included in multiple labels bound to a preset label classification tree; wherein, the preset label classification tree includes multiple classification nodes, and the multiple classification nodes can be bound with the multiple labels by a second client; A rejection module, configured to reject setting the target label to an invalid state when the multiple labels include the target label.

11. A computer device, characterized in that, Includes: At least one processor; And A memory communicatively connected to the at least one processor; wherein: The memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that, Computer instructions are stored in the computer-readable storage medium, and when the computer instructions are executed by a processor, the method according to any one of claims 1 to 9 is implemented.

13. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 9.

Images