CN111291136A

CN111291136A - Identification association relation processing method and device, computer equipment and storage medium

Info

Publication number: CN111291136A
Application number: CN202010072683.7A
Authority: CN
Inventors: 林奇亮; 梁新敏; 陈羲
Original assignee: Shanghai Fengzhi Technology Co Ltd
Current assignee: Shanghai Second Picket Network Technology Co ltd
Priority date: 2020-01-21
Filing date: 2020-01-21
Publication date: 2020-06-16

Abstract

The embodiment of the invention relates to the field of data processing, and provides a method and a device for processing an identifier association relationship, computer equipment and a storage medium, wherein the method comprises the following steps: acquiring a plurality of identifications; the method comprises the steps that a plurality of identifications are graded according to a preset rule to obtain grades corresponding to each identification, wherein the current highest-grade identification with the highest grade in the plurality of identifications is a unique identification, and a first-grade identification in the plurality of identifications corresponds to a plurality of second-grade identifications related to the first-grade identification; generating a current private identification of the current highest-level identification according to the current highest-level identification; and establishing an incidence relation between the current private identity and each identity belonging to the current highest-level identity. The embodiment of the invention dynamically generates the incidence relation between the highest-level identification with uniqueness and each identification by grading the identification, thereby improving the processing efficiency of the incidence relation of the identifications.

Description

Identification association relation processing method and device, computer equipment and storage medium

Technical Field

The present invention relates to the field of data processing, and in particular, to a method and an apparatus for processing an identifier association relationship, a computer device, and a storage medium.

Background

Enterprises provide a plurality of platforms for users aiming at different service meetings, such as various mobile phone software APP, applets, websites and the like, and users often apply for different accounts aiming at different platforms and access the applications through different accounts. That is, the same user may own multiple accounts at multiple different application platforms.

In order to perform centralized analysis on data of the same user and find information acquisition preferences of the user so as to predict potential needs of the user, and to recommend targeted information to the user, a plurality of different accounts of the same user are usually associated in advance so as to find the user of the account from any one of the plurality of accounts of the user. The establishment method of the account association relationship is inefficient and inflexible.

Disclosure of Invention

The invention aims to provide an identification incidence relation processing method, an identification incidence relation processing device, computer equipment and a storage medium, which can dynamically generate the incidence relation between the highest-level identification with uniqueness and each identification by carrying out grade division on the identification, thereby improving the processing efficiency and flexibility of the identification incidence relation and achieving the aim of quickly finding the unique identification corresponding to any identification through the identification incidence relation.

In order to achieve the above purpose, the embodiment of the present invention adopts the following technical solutions:

in a first aspect, this embodiment provides a method for processing an identifier association relationship, where the method is applied to a computer device, and the method includes: acquiring a plurality of identifications; the method comprises the steps of carrying out grade division on a plurality of identifications according to a preset rule to obtain a grade corresponding to each identification, wherein the current highest grade identification with the highest grade in the plurality of identifications is an identification with uniqueness, a first grade identification in the plurality of identifications corresponds to a plurality of second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification; generating a current private identification of the current highest-level identification according to the current highest-level identification; and establishing an incidence relation between the current private identity and each identity belonging to the current highest-level identity.

In a second aspect, the present embodiment provides an identifier association relationship processing apparatus, which is applied to a computer device, and includes an obtaining module, a dividing module, a generating module, and an establishing module, where the obtaining module is configured to obtain a plurality of identifiers; the system comprises a dividing module, a judging module and a judging module, wherein the dividing module is used for carrying out grade division on a plurality of identifications according to a preset rule to obtain a grade corresponding to each identification, the current highest grade identification with the highest grade in the plurality of identifications is an identification with uniqueness, a first grade identification in the plurality of identifications corresponds to a plurality of second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification; the generation module is used for generating a current private identification of the current highest-level identification according to the current highest-level identification; and the establishing module is used for establishing the incidence relation between the current private identification and each identification belonging to the current highest-level identification.

In a third aspect, the present embodiment provides a computer device, including:

one or more processors; a memory for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of identifying associations as described in any one of the preceding embodiments.

In a fourth aspect, the present embodiment provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the identification association relation processing method according to any one of the foregoing embodiments.

Compared with the prior art, the embodiment of the invention provides an identification association relation processing method, which comprises the steps of carrying out grade division on a plurality of acquired identifications according to a preset rule to obtain a grade corresponding to each identification, generating a current private identification of the current highest-grade identification according to the current highest-grade identification, and finally establishing an association relation between the current private identification and each identification belonging to the current highest-grade identification.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.

Fig. 1 is a diagram illustrating an example of a relationship between different types of identifiers in a wechat system according to an embodiment of the present invention.

Fig. 2 is a flowchart illustrating a method for processing an association identifier according to an embodiment of the present invention.

Fig. 3 is a flowchart illustrating another method for processing an identifier association according to an embodiment of the present invention.

Fig. 4 is a flowchart illustrating another method for processing an association relationship according to an embodiment of the present invention.

Fig. 5 is a flowchart illustrating another method for processing an association relationship according to an embodiment of the present invention.

Fig. 6 shows a block diagram of an identifier association processing apparatus according to an embodiment of the present invention.

Fig. 7 shows a block schematic diagram of a computer device provided by an embodiment of the present invention.

Icon: 10-a computer device; 11-a memory; 12-a communication interface; 13-a processor; 14-a bus; 100-identification association processing means; 110-an obtaining module; 120-a partitioning module; 130-a generating module; 140-a setup module; 150-an update module; 160-query module.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.

Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. 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.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.

In the description of the present invention, it should be noted that if the terms "upper", "lower", "inside", "outside", etc. indicate an orientation or a positional relationship based on that shown in the drawings or that the product of the present invention is used as it is, this is only for convenience of description and simplification of the description, and it does not indicate or imply that the device or the element referred to must have a specific orientation, be constructed in a specific orientation, and be operated, and thus should not be construed as limiting the present invention.

Furthermore, the appearances of the terms "first," "second," and the like, if any, are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.

It should be noted that the features of the embodiments of the present invention may be combined with each other without conflict.

The same user may own multiple accounts on multiple different application platforms, and the account in the wechat system is taken as an example in this embodiment. There are three types of accounts within the WeChat hierarchy: a UnionID, an OpenID, and a Universally Unique Identifier UUID (UUID).

If a developer owns multiple mobile applications, web applications, and public accounts (including applets), the user's uniqueness can be distinguished by the UnionID, since the UnionID of the user is unique whenever the mobile application, web application, and public account (including applets) are under the same WeChat opening platform account. In other words, the UnionID is the same for the same user, for different applications under the same WeChat opening platform.

OpenID is a unique identifier representing a user in a current application, such as an applet, a wechat public number, and the like, which are all regarded as an application, and if there are multiple applications, the OpenID of the same user may not be the same. When the public number is not concerned, the user accesses the webpage of the public number and generates an OpenID unique to the user and the public number.

The UUID is generated by a Software Development Kit (SDK) according to mobile phone information under an unauthorized condition, and is not changed when a user does not perform cache cleaning.

Therefore, the same UnionID can have multiple openids, and the same OpenID can have multiple UUIDs. Referring to fig. 1, fig. 1 shows an exemplary diagram of relationships between different types of identifiers in a wechat system according to an embodiment of the present invention, in fig. 1, a UnionID1 belongs to a UnionID type, openids 1 to 3 belong to openids, UUIDs 1 to UUID4 belong to a UUID type, and a UnionID1 has three openids: OpenID 1-OpenID 3, OpenID1 has a UUID: UUID1, OpenID2 has two UUIDs: UUID2 and UUID3, OpenID3 has a UUID: UUID 4.

For analyzing data of the same user, different accounts of the same user are usually associated, for example, in the above figure, UnionID1 is associated with openids 1 to 3, OpenID1 is associated with UUID1 and UUID2, OpenID2 is associated with UUID3, and OpenID3 is associated with UUID 4. Therefore, for the account of the UUID class, the UnionID account associated with the OpenID account can be finally found through the OpenID account associated with the account.

In the prior art, all UnionID, OpenID and UUID accounts are acquired in advance, then are associated, accounts belonging to the same user are determined according to the accounts in the acquired data and the pre-established association relationship among various accounts, and then data belonging to the same user are classified.

However, with the rapid expansion of network systems, it is almost impractical to acquire all UnionID, OpenID and UUID accounts in advance, and certainly, the association relationship between various accounts cannot be established in advance, which means that the association relationship can only be established according to a part of currently acquired accounts, and when a new account appears, the association relationship is re-established according to the part of the acquired accounts and the new account.

In view of the above problems, the inventor proposes an identifier association processing method, an identifier association processing device, a computer device, and a storage medium, which can dynamically generate an association between a highest-level identifier having uniqueness and each identifier according to the acquired identifiers by performing level division on the identifiers, thereby improving the processing efficiency and flexibility of the identifier association. Which will be described in detail below.

Fig. 2 is a flowchart illustrating a method for processing an identifier association according to an embodiment of the present invention, where the method includes the following steps:

step S101, a plurality of identifiers are acquired.

In this embodiment, the identifier may be an account number registered by the user on the application platform, or an ID automatically generated by a local computer device when accessing a web page or a public number and indicating a visitor. The multiple identifiers can be obtained from a user operation log file, or can be obtained through a special identifier obtaining function provided by a management platform of user registration information.

Step S102, the multiple identifications are graded according to a preset rule to obtain grades corresponding to each identification, wherein the current highest grade identification with the highest grade in the multiple identifications is an identification with uniqueness, a first grade identification in the multiple identifications corresponds to multiple second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification.

In this embodiment, the preset rule may be a size that identifies a corresponding authorized right, where the larger the right is, the higher the level is, and the smaller the right is, the lower the level is. The preset rule may also be determined according to the requirement, for example, according to the department grade, the higher the department grade is, the higher the corresponding identification grade is, and vice versa. The first level identifiers are higher level identifiers and the second level identifiers are lower level identifiers. The current highest level is a unique identifier in the plurality of identifiers which have been acquired currently, and the current highest level may be different depending on the plurality of identifiers which have been acquired currently.

Taking fig. 1 as an example, if the currently acquired identifiers are OpenID1 to OpenID3 and UUID1 to UUID4, according to a preset rule, levels of OpenID1 to OpenID3 are 1, levels of UUID1 to UUID4 are 2, and a level of level 1 is greater than a level of level 2, at this time, the currently highest level identifier is OpenID1 to OpenID3, that is, in a range of the currently acquired identifier, OpenID1 to OpenID3 have uniqueness, for UUID1 to UUID4, id1 to OpenID3 are also higher level identifiers at the same time, the lower level identifier associated with OpenID1 is UUID1, the lower level identifiers associated with OpenID2 are UUID2 and UUID3, and the lower level identifier associated with OpenID3 is UUID 4.

Still taking fig. 1 as an example, if the currently acquired identifiers are UnionID1, OpenID2, UUID2, and UUID3, according to a preset rule, the levels of UnionID1 and OpenID2 are 1 and the levels of UUID2, and UUID3 are 3, and the levels of level 1, level 2, and level 3 are sequentially lowered, at this time, the currently highest-level identifier is UnionID1, that is, within the range of the currently acquired identifiers, UnionID1 has uniqueness, for UnionID1 and OpenID2, UnionID1 is also a higher-level identifier, OpenID2 is a lower-level identifier, for OpenID2, UUID2, and UUID3, OpenID2 is a higher-level identifier, and UUID2 and UUID3 are lower-level identifiers.

And step S103, generating a current private identification of the current highest-level identification according to the current highest-level identification.

In this embodiment, there may be multiple current highest-level identifiers, where one current highest-level identifier corresponds to one current private identifier, for example, OpenID1 and OpenID2 are both highest-level identifiers, OpenID1 corresponds to one current private identifier, and OpenID2 corresponds to one current private identifier.

In this embodiment, a corresponding hash value may be calculated according to the current highest-level identifier, the calculated hash value is used as the current private identifier of the current highest-level identifier, or the current highest-level identifier is used as the current private identifier of the current highest-level identifier, at this time, the current highest-level identifier is the same as the current private identifier of the current highest-level identifier, or an identifier type corresponding to the current highest-level identifier may be added after the current highest-level identifier, so as to obtain the current private identifier of the current highest-level identifier.

As a specific implementation manner, according to the current highest-level identity, the method for generating the current private identity of the current highest-level identity may be:

and generating a hash value of the current highest-level identifier by using a preset hash algorithm, and taking the hash value as the current private identifier.

In the present embodiment, the preset hashing algorithm may be, but is not limited to, an MD5 algorithm, a hashing algorithm, and the like. The current private identity obtained by adopting the preset hash algorithm has better dispersity and is convenient for distributed storage. As a specific storage manner, the private identity may be stored in 16 bytes, for example, when the current highest-level identity is UnionID1, the private identity may be represented as: MD5 (first 13 bytes) + type (1 byte) + reserved (2 bytes) of UnionID1, when the current highest level identification is OpenID1, the private identification can be expressed as: MD5 (first 13 bytes) + type (1 byte) + reserved (2 bytes) of OpenID1, when the current highest level identification is UUID1, the private identification can be expressed as: MD5 (first 13 bytes) + type (1 byte) + reserved (2 bytes) of UUID1, where the type indicates the type of the private identifier, for example, the type of UnionID1 is a UnionID type, and as a specific implementation, the type may be represented by an enumerated value, and the value list of the enumerated value is:

(1)0x 00: reserving;

(2)0x 01: a UnionID type, i.e., a private identity, is generated from identities of the UnionID type;

(3)0x 02: OpenID type, i.e. private identity is generated by OpenID type of identity;

(4)0x 03: the UUID type, i.e. the private identity, is generated by an identity of the UUID type.

The reservation (2 bytes) can be a service-generated brand ID, an integer number (less than 2 to the power of 16), and is directly converted into 2 bytes.

Step S104, establishing the incidence relation between the current private identification and each identification belonging to the current highest-level identification.

In this embodiment, when there are multiple current private identities, an association relationship is established between each current private identity and each identity belonging to a current highest-level identity corresponding to the current private identity, for example, in fig. 1, when OpenID1 and OpenID2 are both highest-level identities, the corresponding current private identities are OpenID1_1 and OpenID2_2, respectively, and the established association relationship includes: the association of OpenID1_1 with UUID1, the association of OpenID2_2 with UUID2, and the association of OpenID2_2 with UUID 3.

According to the method for processing the association relationship between the identifiers provided by the embodiment of the invention, the identifiers are classified into the levels, the current private identifier with the unique highest-level identifier is generated, the association relationship between the current private identifier (namely, the highest-level identifier) and each identifier is dynamically generated according to the acquired identifiers, the current private identifier corresponding to any identifier can be quickly found, and the processing efficiency and the flexibility of the association relationship between the identifiers are improved.

In the embodiment of the present invention, in order to automatically update the association relationship related to the new identifier when the new identifier is obtained, and avoid the labor consumed by the participation of the administrator, on the basis of fig. 2, another identifier association relationship processing method is further provided in the embodiment of the present invention, please refer to fig. 3, and fig. 3 shows a flowchart of another identifier association relationship processing method provided in the embodiment of the present invention, where the method further includes the following steps:

and step S105, when the grade of the acquired new identifier is greater than the current highest grade identifier, generating a new private identifier according to the new identifier and updating the current private identifier by using the new private identifier.

In this embodiment, the currently acquired identifier and the corresponding level are shown in table 1:

TABLE 1

Grade 1 (highest grade)	Class 2
		Openid1	UUID1
Openid2	UUID2
		Openid3

The corresponding association relationship can be represented by table 2:

TABLE 2

Private identification	Identification
		Openid1	Openid1
Openid1	UUID1
		Openid2	Openid2
Openid2	UUID2
		Openid3	Openid3

If the new identifier is Unionid1, and the level thereof is greater than the current highest level identifier, after the new identifier is added, table 1 is updated to table 3:

TABLE 3

Accordingly, table 2 is also updated to table 4:

TABLE 4

Private identification	Identification
		Unionid1	Unionid1
Unionid1	Openid1
		Unionid1	UUID1
Openid2	Openid2
		Openid2	UUID2
Openid3	Openid3

And step S106, when the grade of the obtained new identifier is less than or equal to the current highest grade identifier, adding the incidence relation between the current private identifier and the new identifier.

In this embodiment, the currently obtained identifier and the corresponding level are as shown in table 1 above, and the association relationship corresponding to the currently obtained identifier is as shown in table 2 above, where if the obtained new identifier UUID3 has a level smaller than the current highest-level identifier, after the new identifier is added, table 1 is updated to table 5:

TABLE 5

Grade 1 (highest grade)	Class 2
		Openid1	UUID1
Openid2	UUID2
		Openid3	UUID3

Accordingly, table 2 is updated to table 6:

TABLE 6

Private identification	Identification
		Openid1	Openid1
Openid1	UUID1
		Openid2	Openid2
Openid2	UUID2
		Openid3	Openid3
Openid3	UUID3

According to the method for processing the identifier association relationship provided by the embodiment of the invention, when the new identifier is obtained, the association relationship related to the new identifier can be automatically updated according to the grade of the new identifier, so that the identifier association relationship can be dynamically and automatically perfected according to the new identifier which is continuously obtained, and the processing efficiency and flexibility of the identifier association relationship are improved.

In the embodiment of the present invention, after the association relationship is established, in order to quickly find the private identifier corresponding to any identifier according to the association relationship, another identifier association relationship processing method is further provided in the embodiment of the present invention, please refer to fig. 4, where fig. 4 shows a flowchart of another identifier association relationship processing method provided in the embodiment of the present invention, and the method further includes the following steps:

step S201, a to-be-processed identifier is acquired.

In this embodiment, the pending flag may be a flag at any level. The association relationship established by the method for processing the association relationship of the identifications comprises a plurality of private identifications and the identification corresponding to each private identification, so that the private identification corresponding to the identification at any level can be determined according to the association relationship, the identifications belonging to the same private identification can be distinguished, and the data of the same user corresponding to the same private identification can be analyzed conveniently.

Step S202, a first target private identification corresponding to the identification to be processed is determined according to the association relation.

In this embodiment, the first target private identity is a private identity corresponding to the to-be-processed identity, for example, in table 6 above, if the to-be-processed identity is UUID2, the first target private identity is Openid2, and if the to-be-processed identity is UUID3, the first target private identity is Openid 3.

The method for processing the association relationship of the identifiers provided by the embodiment of the invention can determine the private identifier corresponding to any identifier according to the pre-established association relationship, thereby quickly determining the identifiers of the same private identifier and further realizing the high-efficiency processing of the user data corresponding to the same private identifier.

In the embodiment of the present invention, in order to quickly find out an identifier in a preset level type, another identifier association relationship processing method is further provided in the embodiment of the present invention, please refer to fig. 5, where fig. 5 shows a flowchart of another identifier association relationship processing method provided in the embodiment of the present invention, and the method further includes the following steps:

step S301, acquiring the class type to be processed.

In this embodiment, the association relationship further includes a rank type of each private identity, so as to facilitate searching for the identity according to the rank type. For example, in the WeChat hierarchy, the class types may be a UnionID type, an OpenID type, and a UUID type.

Step S302, a second target private identification corresponding to the class type to be processed is determined according to the class type to be processed and the association relation.

It should be noted that other fields, such as the identification of the platform merchant, may also be added to the association relationship according to the needs of the actual scenario.

The method for processing the association relationship of the identifiers provided by the embodiment of the invention can determine the private identifiers of any grade type according to the pre-established association relationship, thereby more flexibly processing the identifiers and expanding the application scene of the method for processing the association relationship of the identifiers provided by the embodiment of the invention.

In order to execute the corresponding steps in the foregoing embodiments and various possible implementations, an implementation of a block schematic diagram of an identifier association processing apparatus applied to a computer device is given below, please refer to fig. 6, where fig. 6 shows a block schematic diagram of an identifier association processing apparatus 100 applied to a computer device according to an embodiment of the present invention. It should be noted that the basic principle and the generated technical effect of the identifier association processing apparatus 100 applied to the computer device provided in the present embodiment are the same as those of the above embodiments, and for the sake of brief description, no mention is made in this embodiment, and reference may be made to the corresponding contents in the above embodiments.

The device 100 for processing the identification association relationship includes an obtaining module 110, a dividing module 120, a generating module 130, an establishing module 140, an updating module 150, and a querying module 160.

An obtaining module 110 is configured to obtain a plurality of identifiers.

The dividing module 120 is configured to perform level division on the multiple identifiers according to a preset rule to obtain a level corresponding to each identifier, where a current highest-level identifier with a highest level among the multiple identifiers is an identifier with uniqueness, and a first-level identifier among the multiple identifiers corresponds to multiple second-level identifiers related to the first-level identifier.

The generating module 130 is configured to generate a current private identity of the current highest-level identity according to the current highest-level identity.

Specifically, the generating module 130 is configured to generate a hash value of the current highest-level identifier by using a preset hash algorithm, and use the hash value as the current private identifier.

The establishing module 140 is configured to establish an association relationship between the current private identity and each identity belonging to the current highest-level identity.

The updating module 150 generates a new private identity according to the new identity and updates the current private identity with the new private identity when the obtained new identity has a level greater than the current highest-level identity.

The updating module 150 adds the association relationship between the current private identity and the new identity when the obtained level of the new identity is less than or equal to the current highest level identity.

A query module 160 for: acquiring a mark to be processed; and determining a first target private identity corresponding to the identity to be processed according to the association relation.

The query module 160, further configured to: acquiring a class type to be processed; and determining a second target private identification corresponding to the class type to be processed according to the class type to be processed and the association relation.

Referring to fig. 7, fig. 7 is a block diagram illustrating a computer device 10 according to an embodiment of the present invention. The computer device 10 may be an entity computer such as a host or a server, a host group composed of a plurality of hosts, or a server group composed of a plurality of servers, or a virtual host or a virtual server, or a virtual host group or a virtual server group, which can realize the same function as the entity computer. The computer device 10 further comprises a memory 11, a communication interface 12, a processor 13 and a bus 14. The memory 11, the communication interface 12, and the processor 13 are connected by a bus 14.

The memory 11 is used for storing a program, for example, the identification association relation processing apparatus 100 in fig. 6, where the identification association relation processing apparatus 100 includes at least one software functional module that can be stored in the memory 11 in a form of software or firmware (firmware), and the processor 13 executes the program after receiving an execution instruction to implement the identification association relation processing method disclosed in the above embodiment.

The Memory 11 may include a high-speed Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Alternatively, the memory 11 may be a storage device built in the processor 13, or may be a storage device independent of the processor 13.

The communication connection with other external devices is realized through at least one communication interface 12 (which may be wired or wireless).

The bus 14 may be an ISA bus, PCI bus, EISA bus, or the like. Fig. 7 is indicated by only one double-headed arrow, but does not indicate only one bus or one type of bus.

The processor 13 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 13. The Processor 13 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components.

An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the identifier association processing method according to any one of the foregoing embodiments.

In summary, embodiments of the present invention provide a method, an apparatus, a computer device, and a storage medium for processing an identifier association relationship, where the method is applied to a computer device, and the method includes: acquiring a plurality of identifications; the method comprises the steps of carrying out grade division on a plurality of identifications according to a preset rule to obtain a grade corresponding to each identification, wherein the current highest grade identification with the highest grade in the plurality of identifications is an identification with uniqueness, a first grade identification in the plurality of identifications corresponds to a plurality of second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification; generating a current private identification of the current highest-level identification according to the current highest-level identification; and establishing an incidence relation between the current private identity and each identity belonging to the current highest-level identity. Compared with the prior art, the embodiment of the invention dynamically generates the incidence relation between the current private identification and each identification by grading the identifications, and can dynamically and automatically perfect the incidence relation, thereby improving the processing efficiency of the identification incidence relation and realizing the purpose of quickly finding the unique identification corresponding to any identification through the identification incidence relation.

The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims

1. An identification incidence relation processing method applied to computer equipment is characterized by comprising the following steps:

acquiring a plurality of identifications;

the method comprises the steps of carrying out grade division on a plurality of identifications according to a preset rule to obtain a grade corresponding to each identification, wherein the current highest grade identification with the highest grade in the plurality of identifications is an identification with uniqueness, a first grade identification in the plurality of identifications corresponds to a plurality of second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification;

generating a current private identification of the current highest-level identification according to the current highest-level identification;

and establishing an incidence relation between the current private identity and each identity belonging to the current highest-level identity.

2. The method of identifying associations as in claim 1, the method further comprising:

and when the grade of the obtained new identifier is greater than the current highest grade identifier, generating a new private identifier according to the new identifier and updating the current private identifier by using the new private identifier.

3. The method of identifying associations as in claim 1, the method further comprising:

and when the grade of the obtained new identifier is less than or equal to the current highest grade identifier, adding an association relationship between the current private identifier and the new identifier.

4. The method for processing identifier association relationship according to claim 1, wherein the step of generating the current private identifier of the current highest-level identifier according to the current highest-level identifier comprises:

5. The method for processing the association relationship between identities according to claim 1, wherein the association relationship includes a plurality of private identities and an identity corresponding to each of the private identities, the method further comprising:

acquiring a mark to be processed;

and determining a first target private identity corresponding to the identity to be processed according to the association relation.

6. The identity association relationship processing method of claim 5, wherein the association relationship further comprises a hierarchical type for each of the private identities, the method further comprising:

acquiring a class type to be processed;

and determining a second target private identification corresponding to the class type to be processed according to the class type to be processed and the association relation.

7. An apparatus for processing an identification association relationship, applied to a computer device, the apparatus comprising:

an obtaining module, configured to obtain a plurality of identifiers;

the dividing module is used for carrying out grade division on the plurality of identifications according to a preset rule to obtain a grade corresponding to each identification, wherein the current highest grade identification with the highest grade in the plurality of identifications is an identification with uniqueness, a first grade identification in the plurality of identifications corresponds to a plurality of second grade identifications related to the first grade identification, and the grade of the first grade identification is greater than that of the second grade identification;

a generating module, configured to generate a current private identity of the current highest-level identity according to the current highest-level identity;

and the establishing module is used for establishing the incidence relation between the current private identity and each identity belonging to the current highest-level identity.

8. The tag association processing apparatus according to claim 7, wherein the generating module is specifically configured to:

9. A computer device, characterized in that the computer device comprises:

one or more processors;

memory storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of identifying associations according to any of claims 1-6.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of processing an identification association according to any one of claims 1 to 6.