CN110597865A

CN110597865A - Method and device for processing user label, computing equipment and storage medium

Info

Publication number: CN110597865A
Application number: CN201910823588.3A
Authority: CN
Inventors: 马家冀; 姜黎明; 王大飞; 江旻
Original assignee: WeBank Co Ltd
Current assignee: WeBank Co Ltd
Priority date: 2019-09-02
Filing date: 2019-09-02
Publication date: 2019-12-20

Abstract

The application discloses a method, a device, a computing device and a storage medium for processing a user label. The method comprises the following steps: obtaining a label operation instruction for indicating to perform preset label operation on a to-be-operated user label of a target user; calling a tag field of a target user, and determining the arrangement order of user tags to be operated in a preset enumeration class, wherein the value of a bit in the tag field is used for representing the state corresponding to the user tags, and a plurality of user tags are sequentially recorded in the enumeration class; determining the target position of the user tag to be operated in the tag field according to the arrangement sequence, and determining the state of the user tag to be operated according to the value of the target position; and performing preset label operation according to the label operation instruction and the state of the label of the user to be operated. The tag storage mechanism for storing the user tags by using the bits in the fields can realize incremental storage of the user tags, improve the storage efficiency of the user tags and reduce the influence on the normal service of the database.

Description

Method and device for processing user label, computing equipment and storage medium

Technical Field

The present application relates to the field of computer technologies in financial (Fintech) technologies, and in particular, to a method, an apparatus, a computing device, and a storage medium for processing a user tag.

Background

With the development of computer technology, more and more technologies are applied in the financial field, the traditional financial industry is gradually changing to financial technology (finth), and the user tag technology is no exception, but due to the requirements of security and real-time performance of the financial industry, higher requirements are also put forward on the user tag technology.

The user tags are used for describing user characteristics, user data are multidimensional, therefore, the user tags are generally described from multiple dimensions, the user tags are the basis of fine operation, the distribution efficiency and the conversion rate of flow can be effectively improved, and accurate marketing can be achieved according to the user characteristics and the value through a user tag technology.

For a multidimensional user tag of a user, the multidimensional user tag is generally maintained through a database, taking a mysql database as an example, a user tag is correspondingly stored through a field, as the user tag is more finely divided, the dimensionality of the user tag is larger and larger, the types of the user tag are more and more, and in the face of a large number of user tags, the storage needs to be performed by increasing the field, however, the process of increasing the field is more troublesome, and may affect normal services, and when the Data volume is larger, the influence of Data Definition Language (DDL) operation on the database availability is larger.

Disclosure of Invention

The embodiment of the application provides a method, a device, a computing device and a storage medium for processing a user tag, which are used for realizing effective storage of the user tag and reducing the influence on the normal service of a database.

In a first aspect, a method for processing a user tag is provided, the method comprising:

obtaining a tag operation instruction, wherein the tag operation instruction is used for indicating that a preset tag operation is performed on a user tag to be operated of a target user;

calling a tag field corresponding to the target user, and determining the arrangement order of the user tags to be operated in a preset enumeration class, wherein the value of a bit in the tag field is used for representing the state corresponding to the user tags, and a plurality of user tags are sequentially recorded in the enumeration class;

determining the target position of the user tag to be operated in the tag field according to the arrangement order, and determining the state of the user tag to be operated according to the value of the target position;

and performing the preset tag operation according to the tag operation instruction and the state of the user tag to be operated.

In one possible design, the tag field includes at least one segment, each segment includes a predetermined number of bits, and determining a target position of the user tag to be operated in the tag field according to the arrangement order includes:

performing preset calculation processing on the arrangement orders and the preset number to obtain a first value and a second value;

determining a target segment of the user tag to be operated in the tag field according to the first value;

and determining the target position of the user tag to be operated in the target segment according to the second value.

In a possible design, performing a predetermined calculation process on the permutation order and the predetermined number to obtain a first value and a second value includes:

and calculating by taking the arrangement orders as dividends and the preset number as divisors, determining the obtained quotient as the first value, and determining the obtained remainder as the second value.

In one possible design, each segment is a field of the field type with the longest field in the database.

In one possible design, the performing the predetermined tag operation according to the tag operation instruction and the state of the user tag to be operated includes:

according to the second value, carrying out shifting operation on a preset binary sequence to obtain a shifted binary sequence; wherein the predetermined binary sequence comprises the predetermined number of bits;

determining a target bit operation mode corresponding to the preset tag operation according to the corresponding relation between the tag operation type and the bit operation mode;

performing bit operation on the shifted binary sequence and the binary sequence corresponding to the target segment according to the target bit operation mode to obtain a bit-operated binary sequence;

and determining an operation result corresponding to the preset label operation according to the binary sequence after the bit operation.

In a possible design, if the predetermined tag operation is a tagging operation or a tag removal operation, determining an operation result corresponding to the predetermined tag operation according to the binary sequence after the bit operation includes:

and updating the binary sequence corresponding to the target segment by using the binary sequence after the bit operation so as to execute a labeling operation or a label removing operation at the target position.

In one possible design, if the predetermined tag operation is a view tag operation, determining an operation result corresponding to the predetermined tag operation according to the binary sequence after the bit operation includes:

determining a binary value corresponding to the binary sequence after the bit operation;

and determining whether the user tag to be operated exists at the target position according to the corresponding relation between the preset binary value and the user tag and the binary value corresponding to the binary sequence after the bit operation.

In a second aspect, an apparatus for processing a user tag is provided, including:

the system comprises an obtaining module, a judging module and a judging module, wherein the obtaining module is used for obtaining a label operation instruction, and the label operation instruction is used for indicating that the preset operation is carried out on a user label to be operated of a target user;

the calling module is used for calling a tag field corresponding to the target user, wherein the value of a bit in the tag field is used for representing the state corresponding to the user tag;

the first determining module is used for determining the arrangement order of the user tags to be operated in a preset enumeration class, and a plurality of user tags are sequentially recorded in the enumeration class;

the second determining module is used for determining the target position of the user tag to be operated in the tag field according to the arrangement order;

the third determining module is used for determining the state of the user tag to be operated according to the value of the target position;

and the tag operation module is used for performing the preset tag operation according to the tag operation instruction and the state of the user tag to be operated.

In one possible design, the tag field includes at least one segment, each segment including a predetermined number of bits, and the second determining module is to:

In one possible design, the second determining module is to:

In one possible design, the tag operating module is to:

In one possible design, the predetermined tagging operation is a tagging operation or a de-tagging operation, and the tagging operation module is configured to:

In one possible design, the predetermined tag operation is a view tag operation, and the tag operation module is configured to:

In a third aspect, there is provided a computing device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps included in any one of the methods of the first aspect when executing the computer program.

In a fourth aspect, there is provided a storage medium storing computer-executable instructions for causing a computer to perform the steps included in any one of the methods of the first aspect.

In the embodiment of the present application, the state corresponding to the user tag is characterized by the value of the bit (bit) included in the field (tag field) in the database, that is, the user tag can be carried by the bit in the field, for example, two binary values of one bit can be used to represent two states of one user tag, for example, the user tag is "sex", then 1 can represent male and 0 can represent female, so that the way of storing the user tags by the bit included in the field is equivalent to the way of using the extended amount of the field, for example, for a 64-bit field, the way of storing the user tags by the bit can store a greater number of user tags than the way of storing the user tags by the entire field in the related art, and under such a storage mechanism, more user tags can be stored, thereby increasing the storage capacity of the user tags, and further, the storage rate of the user tags is improved, so that the DDL operation for increasing the fields is not required to be frequently performed, the influence on the normal service of the database can be reduced as much as possible, and the influence on the availability of the database can also be reduced.

Based on the above-described storage mechanism for storing user tags in bits, when a tag operation instruction corresponding to a target user and used for performing a predetermined tag operation on a user tag to be operated is obtained, a tag field corresponding to the target user may be retrieved from storage data of the user tag, a target position of the user tag to be operated in the tag field may be determined according to an arrangement order of the user tag to be operated in a preset enumeration class, a state corresponding to the user tag to be operated may be determined according to a binary value at the target position, and the predetermined tag operation may be performed at the target position according to the tag operation instruction and the state corresponding to the user tag to be operated. Therefore, based on a tag storage mechanism for storing user tags in a bit-wise manner, different types of tag operations can be correspondingly processed through the tag operation mode in the embodiment of the application, so that the flexibility of the tag operations is improved, and batch tag operations can be performed through the bit operation mode, so that the operation efficiency of the tag operations can be improved to a certain extent.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only the embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.

FIG. 1 is a diagram illustrating an embodiment of the present application in which user tags are stored in bits in fields;

FIG. 2 is another diagram of an embodiment of the present application in which user tags are stored in bits in fields;

FIG. 3 is another diagram of an embodiment of the present application in which a user tag is stored in bits in a field;

FIG. 4 is a flow chart of a method of processing a user tag in an embodiment of the present application;

FIG. 5 is a block diagram of an apparatus for processing a user tag in an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a computing device in an embodiment of the present application;

fig. 7 is another schematic structural diagram of a computing device in an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. The embodiments and features of the embodiments of the present invention may be arbitrarily combined with each other without conflict. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.

The terms "first" and "second" in the description and claims of the present application and the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the term "comprises" and any variations thereof, which are intended to cover non-exclusive protection. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. The "plurality" in the present application may mean at least two, for example, two, three or more, and the embodiments of the present application are not limited.

In addition, the term "and/or" herein is only one kind of association relationship describing an associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in this document generally indicates that the preceding and following related objects are in an "or" relationship unless otherwise specified.

As mentioned above, as the positioning dimension of the user tag is more and more, the user tag is more and more finely divided, so that the variety and the number of the user tag are more and more, and the incremental storage of the user tag is a problem to be considered at present. On the basis of the existing storage mode of storing one user tag through one field in a database table, in order to store the user tags as much as possible, the embodiment of the application provides a storage mechanism for storing the user tags through bits in the field, and the bits in the field can be fully utilized through the bit-based storage mechanism, so that the flexibility and the storage efficiency of user tag storage are improved, and the incremental storage of the user tags is realized.

Based on the bit-wise storage mechanism in the embodiment of the present application, since each bit in the field may include two binary values, i.e., 1 and 0, the tag state corresponding to the user tag may be represented by different binary values of the bits included in the field.

In one possible implementation, each user tag in the embodiment of the present application may be set to two states, and this type of user tag may be represented by 1 bit. For example, taking a user tag of "gender" as an example, two tag states of "male" and "female" may be set, for example, 1 may be used to represent "male", and 0 may be used to represent "female"; for another example, for a user tag such as "age", two tag states of "age is 35 years or more" and "age is 35 years or less" may be set, and "age is 35 years or more" is represented by 1, and "age is 35 years or less" is represented by 0, and the like.

In another possible embodiment, more than two tag states may be set for some user tags, and then multiple types of tag states may be represented by a binary sequence of multiple bits, for example, for a user tag such as "personal credit investigation", for example, three tag states of "credit investigation is particularly good", "credit investigation is better", and "credit investigation is worse" may be set, and then the three tag states may be represented by a binary sequence of 2 bits, for example, "credit investigation is particularly good" is represented by 11, and "credit investigation is better" is represented by 01 or 10, and "credit investigation is worse" is represented by 00, and so on; for another example, for a user tag such as "academic," four tag states of "doctor", "master", "family" and "under family" may be set, and the four tag states may be represented by a binary sequence of 2 bits, for example, "doctor" is represented by 11, "master" is represented by 10, "family" is represented by 01, "under family" is represented by 00, and the like.

For distinguishing the user tags of different users, the user identifier may be used as a primary key index, for example, the mysql database may be used as a primary key index, for example, a user ID may be used as a primary key index, as shown in fig. 1 and fig. 2, and fig. 1 and fig. 2 are schematic illustrations of a plurality of user tags of a plurality of users stored based on a bitwise storage mechanism in an embodiment of the present application.

In fig. 1 and 2, the user tag cases of the four users are identified A, B, C, D with the user ID as the primary key index.

In fig. 1 and 2, all user tags of each user are represented by tag fields, and the tag fields include two fields of tag0 and tag1, tag0 and tag1 may alternatively be referred to as segments in the tag fields, which are illustrated in fig. 1 and 2 by taking an example that two segments of tag0 and tag1 both include 8 bits, in a specific implementation, the field types of tag0 and tag1 may be, for example, the field type with the longest field in a database, taking a mysql database as an example, and tag0 and tag1 may be, for example, bigint fields including 64 bits. In fig. 1 and 2, 16 user tags are represented by 16 tag numbers of 1-16, such as "study calendar" by "1", age "by" 2 ", personal credit" by "3", new and old customer "by" 5 ", purchasing power" by "9", customer level "by" 11 ", quantity of property" by "14", etc., and as can be seen from fig. 1 and 2, each user tag (i.e., each number in 1-16) of a user corresponds to 1 binary digit, i.e., two tag states representing one user tag by one digit in a field.

It should be noted that, for example, one user tag includes two tag states, two binary values (i.e., 0 and 1) of one bit may be respectively represented, and a correspondence between the binary value and the corresponding tag state may be predefined.

In a specific implementation process, for example, the initial states of all the user tags may be set to 0 (in other embodiments, or may be all set to 1), as shown in fig. 1, and further, when the state of a certain user tag of a certain user needs to be modified, the binary value of the corresponding bit may be modified from 0 to 1, that is, for example, as shown in fig. 2. Taking the user tag of "new and old clients" denoted by "5" as an example, according to the predefined correspondence relationship between the binary value and the tag state, for example, "new client" is denoted when the binary value of the corresponding field bit is 0, and "old client" is denoted when the binary value of the corresponding field bit is 1, as can be seen from fig. 2, users A, B, C are both "old clients" and user D is "new client".

Referring to fig. 3 again, fig. 3 shows the tag states corresponding to all the user tags of user a, where two segments included in the tag field of user a are denoted by tagA0 and tagA1, and when a corresponding tag operation is to be performed on a certain user tag (e.g., personal credit) of user a, a field bit corresponding to "personal credit" may be found first, and then the corresponding operation is performed on the field bit.

Of course, in the specific implementation process, other types of user tags may also be deployed according to specific service scenarios, and different tag states may also be set for various user tags, and fig. 1 to fig. 3 are only schematic illustrations in the embodiment of the present application.

For multiple user tags deployed in fig. 1 to fig. 3, in a specific implementation process, an enumeration class may be defined, and then all the user tags are represented by the enumeration class, that is, each user tag in fig. 1 to fig. 3 may be defined as an enumeration element in the enumeration class, and each user tag is sequentially arranged in the enumeration class, for example, the defined enumeration class is:

type tagstye＝(1，2，3，4，5，6，7，8，9，10，11，12，13，14，15，16)。

it can be seen that, in the enumeration class, the user tags corresponding to the tag numbers 1 to 16 are arranged in the order of the numbers from small to large, and each user tag has a corresponding arrangement order (for example, referred to as an arrangement order) in the enumeration class, for example, the arrangement order of the user tag with the tag number of 1 in the enumeration class is 1 st, and the arrangement order of the user tag with the tag number of 8 in the enumeration class is 8 th. And compiling the defined enumeration class into a jar packet, and providing the jar packet for an access system of a database to use. According to the order of arrangement of all the user tags in the enumeration class, the positions of the bits of the user tags in the tag field may be correspondingly set in the same order, in other words, the same order of arrangement of the user tags in the enumeration class may be adopted, and the corresponding order of the bits in the tag field bears the corresponding user tags, for example, the order of arrangement of the user tag with the tag number of 8 (i.e., "purchasing power") in the enumeration class is 8, and then the 8 th bit may also bear the user tag of "purchasing power" in the tag field. Of course, the mapping relationship between the user tag in the enumeration class and the bit in the tag field, which is established by using the same arrangement order, is only an illustrative example, and in the specific implementation process, for example, the mapping relationship may be established by using a reverse order mode, or the mapping relationship may be established after conversion is performed by using a certain conversion rule, which is not limited in the embodiment of the present application.

As described above, each field included in the tag field of the user may be a field type with the longest field length, such as bigint in mysql, so that each bit in the field with the field type of bigint may be used to store one user tag, and since bigint occupies 8 bytes (Byte) and has 64 bits (bit), 64 user tags may be stored in one field of the bigint type, so that the storage number of the user tags may be increased as much as possible, that is, when selecting the field type for storing the user tag, the field type corresponding to the longest field (i.e., the field type with the largest number of bits included) in the database may be selected to store the user tag, so that a smaller number of fields may be used instead of a larger number of fields in a single field. In addition, taking the field type including a 64-bit bigint as an example, one bigint field stores 64 user tags at most, when more user tags need to be stored, the field needs to be increased, for example, the number of user tags needed to be stored is 98, then a field with a field type of bigint may be further increased, that is, tag0 and tag1 in fig. 1-2, so that the field bits may be increased as many as possible by increasing the field once, so as to obtain relatively more field bits by increasing the field bits less frequently, that is, if a plurality of fields are used to jointly store a plurality of user tags, the plurality of fields may all be the field type with the longest field, so that not only the storage number of user tags may be increased as much as possible, but also, for a plurality of fields with the same field structure, the operation is more convenient when the field bits are expanded, and the specific position of a certain user label is calculated reversely according to the digit included in each field, so that the method is more convenient and has higher calculation efficiency.

To further illustrate the technical solutions provided by the embodiments of the present application, the following detailed description is made with reference to the accompanying drawings and the detailed description. Although the embodiments of the present application provide the method operation steps as shown in the following embodiments or figures, more or less operation steps may be included in the method based on the conventional or non-inventive labor. In steps where no necessary causal relationship exists logically, the order of execution of the steps is not limited to that provided by the embodiments of the present application. The method can be executed in sequence or in parallel according to the method shown in the embodiment or the figure when the method is executed in an actual processing procedure or a device.

Referring to a flowchart of a method for processing a user tag provided in an embodiment of the present application shown in fig. 4, the flowchart shown in fig. 1 is described as follows.

Step 401: and obtaining a tag operation instruction, wherein the tag operation instruction is used for indicating that a preset tag operation is performed on a user tag to be operated of a target user.

Based on the storage mechanism for storing user tags by bit as described above with reference to fig. 1 to 3, in a specific implementation process, various tag operations such as checking tags, setting tags (also called marking or labeling), modifying tags, and deleting tags (also called label removing or label removing) can be performed. When some type of tag operation needs to be performed, a tag object that needs to be performed with the tag operation may be determined first, in this embodiment, the object that needs to be performed with the tag operation is referred to as a to-be-operated user tag, for example, and it is assumed that a user corresponding to the to-be-operated user tag is referred to as a target user, that is, the to-be-operated user tag of the target user needs to be performed with the tag operation. Further, a tag operation instruction is generated according to the target user, the tag of the user to be operated and the corresponding tag operation type (for example, referred to as a predetermined tag operation), and then the tag operation instruction can be issued to the database.

As understood in conjunction with fig. 2, it is assumed that the target user to which the tag operation instruction is directed is user a, and the corresponding to-be-operated user tag is a user tag of "new and old customer" corresponding to tag number 5.

Step 402: and calling a label field corresponding to the target user.

In a specific implementation process, as understood by referring to fig. 2, for example, the user ID (i.e., a) of the target user may be used as a primary key index, a tag field corresponding to "a" is determined from the storage data shown in fig. 2, and the retrieved tag field of the user a is shown in fig. 3.

Step 403: determining the arrangement order of the user tags to be operated in a preset enumeration class, wherein the value of a bit in a tag field is used for representing the state corresponding to the user tags, and a plurality of user tags are sequentially recorded in the enumeration class.

Step 404: and determining the target position of the user tag to be operated in the tag field according to the arrangement order.

Step 405: and determining the state of the user tag to be operated according to the value of the target position.

Referring to the foregoing description of the predefined enumeration class, it is assumed that the same arrangement order is used to establish the mapping relationship between the user tags in the enumeration class and the bits in the tag field, so that the arrangement order of the user tag of the "new and old clients" in the tag field of the user is the same as the arrangement order of the user tag in the enumeration class, that is, all the user tags are the 5 th bit, and therefore, the target position of the to-be-operated user tag of the "new and old clients" in the tag field of the user a is also the 5 th bit. For example, according to the correspondence between the preset binary value and the corresponding tag state, the "new client" is represented when the binary value corresponding to the "new client" is 0, and the "old client" is represented when the binary value corresponding to the "old client" is 1, as shown in fig. 3, the field bit of the 5 th bit is 1, and the tag state represented by 1 is the "old client", so that it can be determined that the user a is the old client.

In practice, the tag field of the user comprises at least one segment, i.e. the tag field of the user may comprise only one segment, or may comprise a plurality of segments (e.g. two segments as in fig. 1-3), and it is assumed that each segment comprises a predetermined number of bits, i.e. that each segment comprises a predetermined number of equal number of bits, e.g. 8 bits for both segments as in fig. 1-3. In the process of determining the target position of the to-be-operated user tag in the tag field, the arrangement order and the predetermined number of the to-be-operated user tag in the tag field may be subjected to predetermined calculation processing to obtain the first value and the second value. For example, M represents the arrangement order of the user tag to be operated in the tag field, N represents the number of bits included in each segment in the tag field, and M and N may be calculated in a specific calculation manner to obtain two values, and then a specific segment (for example, referred to as a target segment) of the user tag to be operated in the tagged field is determined according to the first value, and further a specific position (i.e., a target position) of the user tag to be operated in the target segment is determined according to the second value. That is to say, which bit the to-be-operated user tag carries in the tag field can be calculated by a specific calculation method, a method for automatically calculating the position in the background is provided, the bit corresponding to the current to-be-operated tag can be accurately determined from a plurality of bits included in the tag field, and the tag operation efficiency is further improved.

In one embodiment, for example, M may be used as a dividend, N may be used as a divisor to perform a division calculation, a quotient obtained by performing the division calculation may be used as the first value, and a remainder obtained may be used as the second value, that is, the quotient and the remainder are used to locate the identification bit of the user tag in the tag field. As will be understood in conjunction with fig. 3, it is determined in the manner described above that the arrangement rank M of the user tag "new and old clients" to be operated by the user a is 5, and each segment of the tag field includes 8 bits N, and the result of 5 ÷ 8 is a quotient of 0 and 5, where 0 is the aforementioned first value indicating that the target segment of the "new and old clients" is the 0 th segment (i.e., tagA0) in the tag field, and 5 is the aforementioned second value indicating that the target position of the "new and old clients" is the 5 th bit in the tagA0 segment; for another example, the arrangement rank M of the to-be-operated user label "number of properties" of the user a is determined to be 14 in the manner described above, and each segment of the label field includes 8 digits N, and the result of 14 ÷ 8 is that the quotient 1 is more than 6, 1 is the aforementioned first value, which indicates that the target segment of "number of properties" is the 1 st segment (i.e., tagA1) in the label field, and 6 is the aforementioned second value, which indicates that the target position of "number of properties" is the 6 th digit in the tagA1 segment.

Step 406: and performing preset label operation according to the label operation instruction and the state of the label of the user to be operated.

As mentioned above, the types of the tag operations are many, and different types of tag operations may be indicated for the foregoing tag operation instruction, for example, the predetermined tag indicated by the tag operation instruction may be a tag marking operation, a tag viewing operation, or a tag removing operation, and so on.

Based on the storage mechanism for storing the user tag by bit provided in the embodiment of the present application, the tag operation may be performed in a bit operation manner. By means of bit operation, the data stored in the data table is not extracted, and the tag operation is realized by performing predetermined bit operation on the basis of the data.

Based on the foregoing description of determining the target location by the first value and the second value, a shift operation may be performed on a predetermined binary sequence according to the second value to obtain a shifted binary sequence, where the predetermined binary sequence is, for example, a binary sequence corresponding to a value 1 or 0, and the number of binary bits included in the predetermined binary sequence is the same as the number of bits included in each segment in the tag field of the user tag, continuing with the example of fig. 1-3, for example, the predetermined binary sequence is 00000001, that is, a binary sequence representing 1 including 8 bits. Determining a target bit operation mode corresponding to the preset tag operation according to the corresponding relation between the tag operation type and the bit operation mode, wherein the corresponding relation indicates that if the tag operation type is the check tag operation, the corresponding target bit operation mode is AND operation; if the tag operation type is a tagging operation, the corresponding target bit operation mode is an OR operation; if the tag operation type is a tag removal operation, the corresponding target bit operation mode is 'AND operation after bit-wise negation', and the like. Performing bit operation on the shifted binary sequence and the binary sequence corresponding to the target segment where the user tag to be operated is located according to a determined target bit operation mode to obtain a bit-operated binary sequence; and finally, determining an operation result corresponding to the preset label operation according to the binary sequence after the bit operation.

That is, after the target position of the to-be-operated user tag in the tag field is determined as described above, the target bit operation manner corresponding to the predetermined type of operation indicated in the tag operation instruction may be determined according to the corresponding relationship between the predetermined tag operation type and the bit operation manner, and then the corresponding bit operation processing may be performed. The label operation is carried out in a bit operation mode, the data content actually stored in the data table does not need to be extracted, so that the problem that data is inconsistent with expectation can be avoided as much as possible when a plurality of label tasks are updated concurrently, no flail is needed to be considered, the influence on normal business can be reduced as much as possible, and the usability of the database is improved.

In a possible implementation manner, if the predetermined tag operation is a check tag operation, a binary value corresponding to the binary sequence after the bit operation may be determined first; and determining whether the user tag to be operated exists at the target position according to the corresponding relation between the preset binary value and the user tag and the binary value corresponding to the binary sequence after the bit operation. For example, if a user wants to view a specified tag X, all user tags of the user may be taken out according to the user ID key, and then the target position of the specified tag X in the tag field is determined in the foregoing manner; and finally, carrying out AND operation by using the value of 1 left shift N bit (the remainder result in division operation) and the binary sequence of the target segment where the designated label X is located, wherein if the result is greater than 0, the user is indicated to have the designated label X, and otherwise, the user is indicated not to have the designated label X. For example, if the binary sequence of the target segment is 00100100, the binary sequence of 1 is 00000001, 1 is shifted left by 2 bits to obtain a shifted binary sequence of 00000100, and the shifted binary sequence of 00000100 and the binary sequence of the target segment are subjected to a bitwise and operation to obtain a result of 00000100, it is found that the result is greater than 0, which indicates that the user has the specified tag X.

In one possible implementation, if the predetermined tagging operation is a tagging operation or a de-tagging operation, the binary sequence corresponding to the target segment may be updated with the binary sequence after the bit operation, so as to perform the tagging operation or the de-tagging operation at the target position. For example, if a user wants to print a designated tag X, the target position of the designated tag X in the tag field can be determined in the manner described above; and finally, carrying out OR operation on the value of 1 left shift N bit (the remainder result in the division operation) and the binary sequence of the target segment where the designated label X is positioned, and updating the result into the target segment, namely finishing the marking operation.

For another example, if a user wants to remove the designated tag X, the target position of the designated tag X in the tag field can be determined in the manner described above; and finally, carrying out bit-by-bit negation on by using a value of 1 left-shifted N bits (a remainder result in division operation), carrying out AND operation on the value and a binary sequence of the target segment where the designated label X is located, and updating the result into the target segment, namely finishing the label removing operation.

In the embodiment of the application, the user tags are stored by using the bits in the fields, the tag storage capacity of the fields can be expanded, the incremental storage of the user tags is realized, and further, the storage rate of the user tags is improved, so that the DDL operation for increasing the fields is not required to be frequently performed, the normal business influence on a database is reduced, further, various tag operations can be performed by adopting bit operation based on a tag storage mechanism stored according to the bits, tag tasks can be performed independently or in batches, the efficiency of the tag operations is improved, and the data content actually stored in a data table can not be extracted by adopting a bit operation mode, so that when a plurality of tag tasks are updated concurrently, the problem that the data is inconsistent with the expectation can be avoided as much as possible, and the usability of the database is improved.

Based on the same inventive concept, the embodiment of the application provides a device for processing a user tag. The means for processing the user tag may be a hardware structure, a software module, or a hardware structure plus a software module. The device for processing the user tag can be realized by a chip system, and the chip system can be formed by a chip and can also comprise the chip and other discrete devices. Referring to fig. 5, an apparatus for processing a user tag in the embodiment of the present application includes an obtaining module 501, a retrieving module 502, a first determining module 503, a second determining module 504, a third determining module 505, and a tag operating module 506, where:

an obtaining module 501, configured to obtain a tag operation instruction, where the tag operation instruction is used to instruct to perform a predetermined operation on a to-be-operated user tag of a target user;

a retrieving module 502, configured to retrieve a tag field corresponding to a target user, where a value of a bit in the tag field is used to represent a state corresponding to a user tag;

a first determining module 503, configured to determine an arrangement order of user tags to be operated in a preset enumeration class, where multiple user tags are sequentially recorded in the enumeration class;

a second determining module 504, configured to determine, according to the arrangement order, a target position of the to-be-operated user tag in the tag field;

a third determining module 505, configured to determine, according to a value of the target location, a state of the user tag to be operated;

and the tag operation module 506 is configured to perform a predetermined tag operation according to the tag operation instruction and the state of the user tag to be operated.

In a possible embodiment, the tag field includes at least one segment, each segment includes a predetermined number of bits, and the second determining module 504 is configured to:

determining a target segment of a user tag to be operated in a tag field according to the first value;

and determining the target position of the user label to be operated in the target segment according to the second value.

In one possible implementation, the second determining module 504 is configured to:

and calculating by taking the arrangement orders as dividends and the preset number as divisors, determining the obtained quotient as a first value, and determining the obtained remainder as a second value.

In one possible embodiment, each segment is a field of the field type having the longest field in the database.

In one possible implementation, the tag operations module 506 is configured to:

according to the second value, carrying out shifting operation on the preset binary sequence to obtain a shifted binary sequence; wherein the predetermined binary sequence comprises a predetermined number of bits;

performing bit operation on the shifted binary sequence and the binary sequence corresponding to the target segment according to a target bit operation mode to obtain a bit-operated binary sequence;

In one possible embodiment, the predetermined tagging operation is a tagging operation or a de-tagging operation, and the tagging operation module 506 is configured to:

In one possible implementation, the predetermined tag operation is a view tag operation, and the tag operation module 506 is configured to:

and determining whether the user tags to be operated exist in the target position according to the corresponding relation between the preset binary value and the user tags and the binary value corresponding to the binary sequence after the bit operation.

All relevant contents related to the foregoing embodiment of the method for processing a user tag may be referred to the functional description of the functional module corresponding to the apparatus for processing a user tag in the embodiment of the present application, and are not described herein again.

The division of the modules in the embodiments of the present application is schematic, and only one logical function division is provided, and in actual implementation, there may be another division manner, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, may also exist alone physically, or may also be integrated in one module by two or more modules. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.

Based on the same inventive concept, the embodiment of the present application further provides a computing device, where the computing device is a device with communication, computation, and storage functions, and the computing device is, for example, a server or a server cluster, and the computing device may store a user tag by using a database and support multiple tag operations on the user tag. As shown in fig. 6, the computing device in this embodiment of the application includes at least one processor 601, and a memory 602 and a communication interface 603 connected to the at least one processor 601, and a specific connection medium between the processor 601 and the memory 602 is not limited in this embodiment of the application, and fig. 6 illustrates an example in which the processor 601 and the memory 602 are connected by a bus 600, where the bus 600 is shown by a thick line in fig. 6, and connection manners between other components are merely schematic illustrations and are not limited by the illustration. The bus 600 may be divided into an address bus, a data bus, a control bus, etc., and is shown with only one thick line in fig. 6 for ease of illustration, but does not represent only one bus or type of bus.

In the embodiment of the present application, the memory 602 stores instructions executable by the at least one processor 601, and the at least one processor 601 may execute the steps included in the foregoing method for recommending multimedia content by executing the instructions stored in the memory 602.

The processor 601 is a control center of the computing device, and may connect various parts of the entire computing device by using various interfaces and lines, and perform various functions of the computing device and process data by executing or executing instructions stored in the memory 602 and calling up data stored in the memory 602, thereby performing overall monitoring of the computing device. Optionally, the processor 601 may include one or more processing units, and the processor 601 may integrate an application processor and a modem processor, wherein the processor 601 mainly processes an operating system, a user interface, an application program, and the like, and the modem processor mainly processes wireless communication. It will be appreciated that the modem processor described above may not be integrated into the processor 601. In some embodiments, the processor 601 and the memory 602 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.

The processor 601 may be a general-purpose processor, such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like, that may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.

The memory 602, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 602 may include at least one type of storage medium, and may include, for example, a flash Memory, a hard disk, a multimedia card, a card-type Memory, a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Programmable Read Only Memory (PROM), a Read Only Memory (ROM), a charge Erasable Programmable Read Only Memory (EEPROM), a magnetic Memory, a magnetic disk, an optical disk, and so on. The memory 602 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 602 in the embodiments of the present application may also be circuitry or any other device capable of performing a storage function for storing program instructions and/or data.

The communication interface 603 is a transmission interface that can be used for communication, and for example, data can be received or data can be transmitted through the communication interface 603.

With reference to the further structural schematic of the computing device shown in FIG. 7, the computing device also includes a basic input/output system (I/O system) 701, a mass storage device 705 for storing an operating system 702, application programs 703 and other program modules 704, which facilitate the transfer of information between the various components within the computing device.

The basic input/output system 701 includes a display 706 for displaying information and an input device 707 such as a mouse, keyboard, etc. for user input of information. Wherein a display 706 and an input device 707 are coupled to the processor 601 through a basic input/output system 701 that is coupled to the system bus 600. The basic input/output system 701 may also include an input/output controller for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, an input-output controller may also provide output to a display screen, a printer, or other type of output device.

The mass storage device 705 is connected to the processor 601 through a mass storage controller (not shown) connected to the system bus 600. The mass storage device 705 and its associated computer-readable media provide non-volatile storage for the server package. That is, the mass storage device 705 may include a computer-readable medium (not shown), such as a hard disk or CD-ROM drive.

According to various embodiments of the invention, the computing device package may also be operated by a remote computer connected to the network through a network, such as the Internet. That is, the computing device may be connected to the network 708 through the communication interface 603 coupled to the system bus 600, or may be connected to another type of network or remote computer system (not shown) using the communication interface 603.

Based on the same inventive concept, the present application also provides a storage medium, which may be a computer-readable storage medium, and stores computer instructions, which when run on a computer, cause the computer to perform the steps of the method for processing a user tag as described above.

Based on the same inventive concept, embodiments of the present application further provide an apparatus for processing a user tag, where the apparatus for processing a user tag includes at least one processor and a storage medium, and when instructions included in the storage medium are executed by the at least one processor, the steps of the method for processing a user tag as described above may be performed.

Based on the same inventive concept, the embodiment of the present application further provides a chip system, which includes a processor and may further include a memory, and is configured to implement the steps of the method for processing the user tag as described above. The chip system may be formed by a chip, and may also include a chip and other discrete devices.

In some possible embodiments, the various aspects of the method for processing a user tag provided in the embodiments of the present application may also be implemented in the form of a program product, which includes program code for causing a computer to perform the steps in the method for processing a user tag according to various exemplary embodiments of the present application described above when the program product runs on the computer.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A method of processing a user tag, the method comprising:

2. The method of claim 1, wherein the tag field comprises at least one segment, each segment comprising a predetermined number of bits, and wherein determining the target position of the to-be-operated user tag in the tag field according to the ranking order comprises:

3. The method of claim 2, wherein performing a predetermined calculation process on the permutation order and the predetermined number to obtain a first value and a second value comprises:

4. The method of claim 2, wherein each segment is a field of a field type having a longest field in the database.

5. The method according to any one of claims 2-4, wherein performing the predetermined tag operation according to the tag operation instruction and the state of the user tag to be operated comprises:

6. The method of claim 5, wherein the predetermined tag operation is a tag operation or a tag removal operation, and determining an operation result corresponding to the predetermined tag operation according to the binary sequence after the bit operation comprises:

7. The method of claim 5, wherein the predetermined tag operation is a view tag operation, and determining an operation result corresponding to the predetermined tag operation according to the binary sequence after the bit operation comprises:

8. An apparatus for processing a user tag, comprising:

9. A computing device comprising at least one processor and at least one memory, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the steps of the method of any of claims 1-7.

10. A storage medium storing computer instructions which, when executed on a computer, cause the computer to perform the steps of the method according to any one of claims 1 to 7.