CN114880522A

CN114880522A - Method and device for realizing ID Mapping based on graph database

Info

Publication number: CN114880522A
Application number: CN202210303694.0A
Authority: CN
Inventors: 朱贺贺; 李锐佳; 周建宏; 朱文俊; 文朝
Original assignee: Bangdao Technology Co ltd
Current assignee: Bangdao Technology Co ltd
Priority date: 2022-03-24
Filing date: 2022-03-24
Publication date: 2022-08-09

Abstract

The invention provides a method and a device for realizing ID Mapping based on a graph database, wherein the method comprises the following steps: acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record; carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to obtain a first ID relation network corresponding to the Tth day; and cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to obtain a second ID relational network corresponding to the Tth day. According to the invention, the expired ID is cleaned by cleaning the ID nodes with the activity degree lower than the threshold, the weak association relationship of the ID nodes is cleaned by disconnecting the ID node relationship with the activity degree lower than the threshold, and the reliability, accuracy and stability of the user ID relationship network are improved.

Description

Method and device for realizing ID Mapping based on graph database

Technical Field

The invention relates to the technical field of big data, in particular to a method and a device for realizing ID Mapping based on a graph database.

Background

In real life, a user can obtain services provided by enterprises from various entrances through various devices; enterprises can also develop various business lines, form various products, and provide services for users from different channels, so that data of the same user come from different data sources, and the data are various and dispersed in various positions.

The large data platform physically solves the problem of data island of data scattered in various positions, but logically, the data from a plurality of different sources are difficult to establish association, and the data are still in a split state, so that only one picture image of a user can be constructed from single or few data, which is equivalent to a 'blind person' image, and complete information of the user is difficult to provide.

One common feature of data from multiple different sources is that the data is from the same user, and information identifying the user Identity is usually recorded in the data, and is referred to as "Identity Document (ID)". The user ID is a serial number representing a user entity, such as an identification number, a mobile phone number, a mailbox, a micro signal, a device number, a Cookie ID, a Media Access Control (MAC) address, and the like. Establishing a relationship between user IDs enables establishing a connection between data. And the process of constructing the relationship between the user IDs is the main process of ID Mapping.

In popular terms, ID Mapping is to identify user IDs in data from a plurality of different sources as a same subject by various technical means and generate a uniform identity (i.e. one-ID) for identifying a unique identity of a user. According to the data structure used in the processing procedure, the implementation of ID Mapping can be roughly summarized into 3 types: dictionary mode, table mode and graph mode, but the current concrete implementation methods in the 3 modes mainly focus on constructing ID relationship, and do not pay attention to the solution of the problems of ID expiration, multiplexing and complex relationship among IDs, but the two problems seriously affect the reliability, accuracy and stability of the constructed user ID relationship network. The problem of ID expiration and multiplexing is caused by different life cycles and accuracies of user IDs, for example, a person usually has only one identity card number for a lifetime, and a mobile phone number, a mailbox, an equipment number and the like are changed more frequently; the problem of complex relation among IDs is caused by real complex scenes, such as multiple accounts of the same equipment, multiple devices of the same account, multiple accounts, multiple data sources, abnormal data and the like.

Disclosure of Invention

The invention provides a method and a device for realizing ID Mapping based on a graph database, which are used for solving the defects of low reliability, low accuracy and low stability of a user ID relationship network in the prior art, realizing effective processing of ID expiration, ID multiplexing and ID complex relationship, and improving the reliability, accuracy and stability of the user ID relationship network.

The invention provides a method for realizing ID Mapping based on a graph database, which comprises the following steps:

acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record;

carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to obtain a first ID relation network corresponding to the Tth day;

and cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to obtain a second ID relational network corresponding to the Tth day.

Optionally, before the cleaning the first ID relationship network according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, the method further includes:

updating the attribute of the ID node and the attribute of the ID node relation respectively;

respectively extracting the characteristics of the updated attributes of the ID nodes and the updated attributes of the ID node relationship to obtain the characteristic values of the ID nodes and the characteristic values of the ID node relationship;

acquiring the activity of the ID node according to the characteristic value of the ID node and the weight corresponding to the characteristic value of the ID node;

and acquiring the activity of the ID node relationship according to the characteristic value of the ID node relationship and the weight corresponding to the characteristic value of the ID node relationship.

Optionally, the cleaning the first ID relationship network according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, and acquiring the second ID relationship network corresponding to the tth day includes:

clearing the ID nodes out of the first ID relational network under the condition that the activity of the ID nodes in the first ID relational network is less than a node activity threshold value;

under the condition that the activity of the ID node relationship in the first ID relationship network is smaller than a relationship activity threshold value, clearing the ID node relationship out of the first ID relationship network;

and acquiring a second ID relation network corresponding to the Tth day according to the cleaned first ID relation network.

Optionally, the obtaining, according to the cleaned first ID relationship network, a second ID relationship network corresponding to the tth day includes:

in the case that the ID node or the cleaning of the ID node relationship does not cause the relationship subnet in the first ID relationship network to split, the unified identity of the relationship subnet in the second ID relationship network is the unified identity of the relationship subnet in the first ID relationship network;

and under the condition that the relationship subnet in the first ID relationship network is split into a plurality of relationship subnets due to the cleaning of the ID node or the relationship of the ID node, the unified identity of one relationship subnet in the plurality of relationship subnets in the second ID relationship network is the unified identity of the relationship subnet in the first ID relationship network, and the unified identities of other relationship subnets in the plurality of relationship subnets are newly generated unified identities.

Optionally, after the first ID relationship network is cleaned according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, and a second ID relationship network corresponding to the tth day is acquired, the method further includes:

acquiring the relation between the inactive ID nodes and the inactive ID nodes in preset time from the source ID data record;

updating the activity level of the inactive ID node and the activity level of the inactive ID node relationship;

and cleaning the second ID relational network according to the updated activity of the inactive ID nodes and the updated activity of the inactive ID node relationship, and acquiring a third ID relational network corresponding to the Tth day.

Optionally, before the ID node appearing on the tth day, the ID node relationship appearing on the tth day, and the ID relationship network corresponding to the T-1 th day are identified and connected, and the method further includes:

acquiring a uniform identity mark existing on the T-1 th day according to the ID node appearing on the T-1 th day and the mark mapping dictionary corresponding to the T-1 th day;

and acquiring the ID relation network corresponding to the T-1 day according to the unified identity existing on the T-1 day.

Optionally, the identifying and communicating the ID node appearing on the tth day, the ID node relationship appearing on the tth day, and the ID relationship network corresponding to the T-1 th day, and after acquiring the first ID relationship network corresponding to the tth day, the method further includes:

under the condition that a unified identity exists in a relation subnet in the first ID relation network, the unified identity of the relation subnet is the existing unified identity;

under the condition that more than one unified identity exists in a relation subnet in the first ID relation network, the unified identity of the relation subnet is the unified identity with the earliest creation time and the largest merging or splitting times;

and under the condition that the unified identity does not exist in the relation subnet in the first ID relation network, the unified identity of the relation subnet is a newly generated unified identity.

The invention also provides a device for realizing ID Mapping based on the graph database, which comprises:

the first acquisition module is used for acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record;

the second acquisition module is used for identifying and communicating the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to acquire a first ID relation network corresponding to the Tth day;

and the third acquisition module is used for cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to acquire a second ID relational network corresponding to the Tth day.

The invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor, when executing the program, implements the method for implementing ID Mapping based on a graph database as described in any one of the above.

The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method for implementing ID Mapping based on a graph database as described in any one of the above.

The invention also provides a computer program product comprising a computer program which, when executed by a processor, implements a method for implementing ID Mapping based on a graph database as described in any one of the above.

According to the method and the device for realizing ID Mapping based on the graph database, the expired ID is cleaned by cleaning the ID nodes with the activity lower than the threshold value, the problem of ID expiration is solved, the weak association relation among the ID nodes is cleaned by disconnecting the ID node relation with the activity lower than the threshold value, the problem of ID multiplexing and ID complex relation is solved, and therefore the reliability, the accuracy and the stability of a user ID relation network are improved.

Drawings

In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a flowchart illustrating a method for implementing ID Mapping based on a graph database according to the present invention;

FIG. 2 is a second flowchart of the method for implementing ID Mapping based on a graph database according to the present invention;

FIG. 3 is a schematic structural diagram of an apparatus for implementing ID Mapping based on a graph database according to the present invention;

fig. 4 is a schematic structural diagram of an electronic device provided in the present invention.

Detailed Description

The dictionary mode of ID Mapping is the simplest of 3 types of methods, in the dictionary mode of ID Mapping, a keyword (key) is used for representing an ID in source data, a value (value) is used for representing a generated unified one-ID, the main flow is to judge whether an extracted ID is in the key, and if the extracted ID exists in the key, the existing one-ID is used; if the extracted ID does not exist in the key, a new one-ID is created. ID association may occur as the number of IDs increases, so there is also a need to merge dictionaries, i.e., IDs that have an existing ID relationship but do not establish inter-ID association.

The dictionary mode of ID Mapping has the advantages of simple principle, easy realization and high processing efficiency; the disadvantages are unsolved problems of ID expiration and multiplexing and ID complex relationships, e.g. multiple users may be combined into one user with multiple users of the device.

The most common organization of IDs is a table record, and one record contains a plurality of IDs appearing at the same time and also contains an ID relationship, so the table method is the most proposed method among the 3-type methods. The method comprises the following steps: merging records with the same ID forms a unified one-ID in units of records, and the key point is to reduce the error rate of merging records.

The table mode of ID Mapping has the advantages that the principle and the implementation are simple, and the error rate can be reduced during combination; the method has the disadvantages that the processing speed is low when the data volume is large, the independent processing of a single ID and the relation of the ID is difficult, and the problems of ID expiration and multiplexing and the problem of ID complex relation, such as the problem caused by mobile phone number assignment, are still not solved.

The nature of the ID relationships is the network structure, and thus graph-wise is the most straightforward of class 3, and as graph databases mature, graph-wise solutions are more widely used. The method mainly comprises the steps that IDs in records are constructed into graphs, and edge threshold values are usually set in the graph construction process to filter out weak association relations of the IDs; then obtaining all connected subgraphs in the graph through a maximum connected subgraph algorithm, and generating a unique one-ID for each subgraph, wherein one subgraph represents a user ID relationship network; this approach handles the ID complex relationship problem by setting user behavior rules (e.g., setting a threshold number that a user can have a certain type of ID within a preset time) and ID priorities (e.g., setting the highest priority for identification numbers).

The ID Mapping graph mode has the advantages that the graph structure represents the ID relationship, so that the ID relationship is intuitive and easy to understand, and the single ID and ID relationship is easy to process; the disadvantage is that there is no method for effectively processing the problem of ID expiration and multiplexing, and the problem of ID complex relation is too simple although the processing rule is proposed.

In order to effectively process the problems of ID expiration and multiplexing and ID complex relation and improve the reliability, accuracy and stability of a user ID and an ID relation network, the invention realizes the clearing of expired IDs and solves the problem of ID expiration by clearing ID nodes with the activity lower than a threshold value, realizes the clearing of weak association relation among ID nodes by disconnecting the ID node relation with the activity lower than the threshold value and solves the problem of ID multiplexing and ID complex relation, thereby improving the reliability, accuracy and stability of the user ID and the ID relation network.

In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without inventive effort based on the embodiments of the present invention, are within the scope of the present invention.

Fig. 1 is a schematic flow chart of a method for implementing ID Mapping based on a graph database, as shown in fig. 1, the method includes:

step 101, obtaining the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record.

Specifically, fig. 2 is a second flowchart of the method for implementing ID Mapping based on a graph database, provided by the present invention, where source data includes various ID data records, the relationship between an ID and an ID in each ID data record is written into the graph database, and an attribute of an ID node relationship are initialized. Table 1 is an attribute table of ID nodes, and table 2 is an attribute table of ID node relationships.

TABLE 1 Attribute Table for ID nodes

As can be seen from table 1, the attributes of the ID nodes include a node value, a node type, a node record date 1, a date that the node has been most recently activated, a number of node activation days, a list of days from the record of the 1 st occurrence of the node, a node value, and a node activity, wherein a node priority and a node activity threshold are closely related to the node type, two ID nodes of the same node type have the same node priority, and two ID nodes of the same node type have the same node activity threshold.

TABLE 2 Attribute Table for ID node relationships

As can be seen from table 2, the attributes of the ID node relationship include a relationship description, a relationship type, a relationship node record date 1, a relationship recent active date, a relationship active number of days, a list of days from the record of the 1 st occurrence of the relationship each time, a relationship activity, a relationship priority, and a relationship activity threshold, where the relationship priority and the relationship activity threshold are closely related to the relationship type, two ID node relationships of the same relationship type have the same relationship priority, and two ID node relationships of the same relationship type have the same relationship activity threshold.

In initialization, all the attributes of the ID nodes and the attributes of the ID node relationships, except for the node priority, the relationship priority, and the node degree value, take 1.

And writing the relation between the ID and the ID contained in the source data into the graph database, and acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the graph database.

For example, the ID node appearing on the T-th day includes a device number dev _001, a mobile phone number 150, an identification number 430, an account number ccc, and an identification number 560. The ID node relationship appearing on the T-th day is the relationship between the device number dev _001 and the mobile phone number 150, and the relationship between the identification number 430 and the account number ccc.

And 102, carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day, and acquiring the first ID relation network corresponding to the Tth day.

Specifically, before the first ID relationship network corresponding to the T-th day is obtained through identification communication, the ID relationship network corresponding to the T-1 th day needs to be obtained first.

Specifically, the unified identity is a one-ID, which is a Chinese translation of the one-ID. The identifier mapping dictionary comprises one-ID, and ID nodes and ID node relations corresponding to each one-ID.

And comparing the ID node appearing on the Tth day with the ID node contained in the identifier mapping dictionary corresponding to the T-1 th day, searching the ID node appearing on the Tth day and the ID node contained in the identifier mapping dictionary corresponding to the T-1 th day, and acquiring the one-ID corresponding to the searched ID node, namely the one-ID existing on the T-1 th day according to the corresponding relation of the searched ID node in the identifier mapping dictionary corresponding to the T-1 th day. After the one-ID existing on the T-1 th day is obtained, the ID node and the ID node relation corresponding to the one-ID existing on the T-1 th day are searched from the graph database, and therefore the ID relation network corresponding to the T-1 th day is obtained.

For example, the node mobile phone number 150 appearing on the T-th day also exists in the identifier mapping dictionary corresponding to the T-1 th day, the one-ID corresponding to the mobile phone number 150 is the one-ID01, and then the ID node and the ID node relationship having the corresponding relationship with the one-ID01 are searched in the graph database, so that the relationship between the identity card number 320, the account number aaa, the mobile phone number 150 associated with the one-ID01, the relationship between the identity card number 320 and the mobile phone number 150, and the relationship between the identity card number 320 and the account number aaa are found.

The method comprises the steps of obtaining the one-ID existing on the T-1 th day by using the ID node appearing on the T-1 th day and the identification mapping dictionary corresponding to the T-1 th day, and searching the relation between the ID node corresponding to the one-ID existing on the T-1 th day and the ID node according to the graph database, so that the ID relation network corresponding to the T-1 th day is obtained, and a foundation is laid for subsequently utilizing the ID relation network corresponding to the T-1 th day to carry out identification communication and obtaining the first ID relation network corresponding to the T-1 th day.

After the first ID relation network corresponding to the Tth day is obtained, the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 day are identified and communicated by using a maximum communication subgraph algorithm, namely the ID node and the ID node relation appearing on the Tth day are connected to the ID relation network corresponding to the T-1 day, so that the first ID relation network corresponding to the Tth day is obtained.

After the first ID relationship network is acquired, it is necessary to determine the one-ID of the relationship subnet in the first ID relationship network.

Optionally, after the ID node appearing on the tth day, the ID node relationship appearing on the tth day, and the ID relationship network corresponding to the T-1 th day are identified and communicated, and the first ID relationship network corresponding to the tth day is acquired, the method further includes:

under the condition that more than one unified identity exists in a relation subnet in a first ID relation network, the unified identity of the relation subnet is the unified identity with the earliest creation time and the largest merging or splitting times;

Specifically, table 3 is an attribute table of one-ID, and the attributes of one-ID include a node value, a node generation time, a merging or splitting time, and the number of times of merging or splitting. The relation establishment time is between the ID node and the one-ID, and the relation establishment time refers to the time for establishing the relation between the ID node and the one-ID.

TABLE 3 Attribute Table for one-ID

Numbering	Properties	Description of the invention
			1	Node value	Unique identification value of relational subnet
2	Node generation time	Time to create one-ID node
			3	Merging or splitting times	Time field updated when merging or splitting relational subnets
4	Number of mergers or splits	Number of merges and splits

And under the condition that one-ID exists in the relation subnet in the first ID relation network, the one-ID of the relation subnet is the existing one-ID.

And under the condition that a plurality of one-IDs exist in the relation subnet in the first ID relation network, selecting the one-ID with the earliest creation time and the largest merging or splitting times from the plurality of one-IDs as the one-ID of the relation subnet.

And if the creation time and the merging or splitting times of the plurality of one-IDs are the same, randomly selecting one from the plurality of one-IDs as the one-ID of the relational subnet.

And under the condition that the one-ID does not exist in the relation subnet in the first ID relation network, generating a new one-ID according to the ID node and the ID node relation in the relation subnet, and taking the newly generated one-ID as the one-ID of the relation subnet.

The determination of the one-ID of the relation subnet in the first ID relation network is clear, the one-ID completes the association between the IDs, and the determination of the one-ID is favorable for acquiring all ID nodes related to the one-ID and all ID node relations.

And 103, cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation, and acquiring a second ID relational network corresponding to the Tth day.

Specifically, ID nodes with node activity lower than a node activity threshold in a first ID relational network are cleaned out from the first ID relational network; and clearing the ID node relation with the relation activity lower than the relation activity threshold value in the first ID relation network from the first ID relation network. And acquiring a second ID relation network corresponding to the Tth day according to the cleaned first ID relation network.

Optionally, before clearing the first ID relationship network according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, the method further includes:

Specifically, two types of relationships exist between ID nodes and ID nodes in the first ID relationship network, wherein one type is the relationship between the ID nodes and the ID nodes which do not appear on the T-1 th day and appear on the T-1 th day; the other is the ID node and ID node relationship that appears on day T-1 and does not appear on day T.

For the ID nodes and ID node relationships that do not occur on day T-1 and occur on day T, the attributes of all ID nodes in table 1 are updated, and the attributes of all ID node relationships in table 2 are updated.

And for the ID node and ID node relationship which appears on the T-1 th day and does not appear on the T-1 th day, only updating the node activity attribute of the ID node, only updating the relationship activity attribute of the ID node relationship, and not updating other attributes.

And extracting the characteristics for evaluating the node activity of the ID node and evaluating the relationship activity of the ID node relationship from the updated attribute of the ID node and the updated attribute of the ID node relationship. Table 4 is a feature extraction processing table of the relationship between ID nodes and ID nodes, and s in table 4 indicates a feature value before normalization feature processing.

Table 4 characteristic extraction processing table of ID node and ID node relation

As can be seen from table 4, the characteristics of the node activity for evaluating the ID node are the node priority, the ratio of the number of active days to the number of days of the 1 st record from the current processing date, the average number of active interval days, the number of days of the latest active date from the current processing date, the standard deviation of the number of active interval days, the regularity of the interval days, and the node value.

The characteristics of the relationship liveness for evaluating the ID node relationship are the proportion of the number of active days to the number of days from the 1 st record to the current processing date, the average number of active interval days, the number of days from the latest active date to the current processing date, the number of days difference between the latest active dates of two nodes of the relationship, the standard deviation of the number of active interval days, the regularity of interval days and the relationship priority.

And normalizing the extracted features to obtain the feature value of the ID node and the feature value of the ID node relation.

And acquiring the activity of the ID node according to the characteristic value of the ID node and the weight corresponding to the characteristic value of the ID node.

The expression for the liveness of an ID node is as follows:

in the formula, X represents the activity of the ID node, and X represents the normalized activityThe subscript of x corresponds to the number in table 4, α represents the weight corresponding to each node eigenvalue, α ₁ Is x ₂ Corresponding weight, α ₂ Is x ₃ Corresponding weight, α ₃ Is x ₄ Corresponding weight, α ₄ Is x ₅ Corresponding weight, α ₅ Is x ₇ Corresponding weight, α ₆ Is x ₈ And corresponding weights are obtained by scoring by experts through an analytic hierarchy process.

The expression of liveness of ID node relationships is as follows:

in the formula, Y represents the activity of the ID node relationship, x represents the characteristic value after normalization, the subscript of x corresponds to the number in the table 4, β represents the weight corresponding to each relationship characteristic value ₁ Is x ₂ Corresponding weight, β ₂ Is x ₃ Corresponding weight, β ₃ Is x ₄ And x ₅ Combining the corresponding weights, β ₄ Is x ₆ Corresponding weight, β ₅ Is x ₇ And corresponding weights are obtained by scoring by experts through an analytic hierarchy process.

The method comprises the steps of updating the attributes of the relationship between the ID nodes and the ID nodes, extracting the features according to the updated attributes, carrying out normalization processing on the features, and finally obtaining the liveness according to the feature values and the weights corresponding to the feature values, so that the calculation method of the liveness is defined, and the relationship between the ID nodes and the ID nodes is further cleaned by utilizing the liveness.

Optionally, the step of cleaning the first ID relationship network according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship to obtain the second ID relationship network corresponding to the tth day includes:

under the condition that the activity of the ID nodes in the first ID relational network is smaller than the threshold value of the activity of the nodes, the ID nodes are cleaned out of the first ID relational network;

Specifically, after the activity of the ID node is obtained, the activity of the ID node is compared with a node activity threshold, and the ID nodes with the activity smaller than the node activity threshold are cleaned.

And after the activity degree of the ID node relation is obtained, comparing the activity degree of the ID node relation with a relation activity degree threshold value, and clearing the ID node relation of which the activity degree is less than the relation activity degree threshold value.

The ID nodes with the activity lower than the threshold are cleaned, the outdated IDs are cleaned, the ID node relationship with the activity lower than the threshold is disconnected, the weak association relationship among the ID nodes is cleaned, and the reliability, accuracy and stability of the user ID and the ID relationship network are improved.

Optionally, obtaining a second ID relationship network corresponding to the tth day according to the cleaned first ID relationship network includes:

under the condition that the ID node or the cleaning of the ID node relation does not cause the relation subnet in the first ID relation network to be split, the unified identity of the relation subnet in the second ID relation network is the unified identity of the relation subnet in the first ID relation network;

when the relationship subnet in the first ID relationship network is split into a plurality of relationship subnets due to the cleaning of the ID node or the relationship of the ID node, the unified identity of one relationship subnet in the plurality of relationship subnets in the second ID relationship network is the unified identity of the relationship subnet in the first ID relationship network, and the unified identities of other relationship subnets in the plurality of relationship subnets are the newly generated unified identities.

Specifically, when the relationship between the ID node and the ID node is cleared, it needs to be considered whether a new relationship subnet is generated, that is, when the clearing needs to be considered, the relationship subnet will not be split, and after the splitting, the determination of the one-ID of the split relationship subnet needs to be considered.

And under the condition that the ID node or the cleaning of the ID node relation does not cause the relation subnet in the first ID relation network to be split, keeping the one-ID of the relation subnet unchanged, wherein the one-ID of the relation subnet in the second ID relation network is the one-ID of the relation subnet in the first ID relation network.

For example, in the first ID relationship network, the one-ID of the relationship subnet 1 is one-ID1, some ID nodes and some ID node relationships are cleaned from the relationship subnet 1, the relationship subnet 1 after cleaning is not split, the relationship subnet 1 after cleaning is the relationship subnet 2 in the second ID relationship network, and the one-ID of the relationship subnet 2 is still one-ID 1.

And when the ID node or the relationship between the ID nodes causes the relationship subnet in the first ID relationship network to be split into a plurality of relationship subnets, selecting one relationship subnet conforming to a preset rule from the plurality of relationship subnets according to the preset rule to inherit the one-ID of the relationship subnet in the first ID relationship network, wherein the one-ID of the other relationship subnets is a new one-ID generated according to the relationship between the ID nodes and the ID nodes.

The preset rule may be that one relationship subnet is selected from the plurality of relationship subnets in the selection order of "the ID node has the largest activity, the most ID node active days, the most ID nodes, and the most ID node recent active date".

Under the condition that 'the ID node activity is maximum, the ID node activity days are maximum, the ID node quantity is maximum and the ID node recent activity dates' corresponding to the plurality of relational subnets are the same, one relational subnet is randomly selected from the plurality of relational subnets.

For example, in the first ID relationship network, the one-ID of the relationship subnet a is one-IDA, some ID nodes and some ID node relationships are cleaned from the relationship subnet a, the relationship subnet a after cleaning is split, and the relationship subnet a after cleaning is the relationship subnet B, the relationship subnet C, and the relationship subnet D in the second ID relationship network.

And comparing the ID node activity degrees corresponding to the relation subnet B, the relation subnet C and the relation subnet D respectively to be maximum, if the ID node activity degree corresponding to the relation subnet B is maximum in the three relation subnets, the one-ID of the relation subnet B is the one-IDA of the relation subnet A, and the relation subnet C and the relation subnet D generate a new one-ID according to the relation between the ID node and the ID node.

If the ID node activity degrees corresponding to the relationship subnet B, the relationship subnet C, and the relationship subnet D are the same, comparing that the ID node activity days corresponding to the relationship subnet B, the relationship subnet C, and the relationship subnet D are the maximum, the ID node activity days corresponding to the relationship subnet B is the maximum 15 days, the ID node activity days corresponding to the relationship subnet C is the maximum 25 days, and the ID node activity days corresponding to the relationship subnet D is the maximum 12 days, the one-ID of the relationship subnet C is the one-IDA of the relationship subnet a, and the relationship subnet B and the relationship subnet D generate a new one-ID according to the relationship between their own ID node and ID node.

If the relationship subnet B, the relationship subnet C and the relationship subnet D respectively correspond to the condition that the ID node activity is maximum, the ID node activity days are maximum, the ID node quantity is maximum and the ID node recent activity date are the same, one-IDA of the relationship subnet A is randomly selected from the relationship subnet B, the relationship subnet C and the relationship subnet D, and the other two relationship subnets generate a new one-ID according to the relationship between the ID node and the ID node.

And updating the acquired second ID relational network into a graph database, and updating the relational sub-network with updated attribute and activity to the graph database for the relational sub-network with one-ID.

And re-determining the one-ID of the ID relation subnet according to whether the ID relation subnet is split or not caused by the cleaning of the ID node and the ID node relation, thereby improving the reliability, the accuracy and the stability of the ID relation network.

Optionally, after the first ID relationship network is cleaned according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, and the second ID relationship network corresponding to the tth day is acquired, the method further includes:

updating the activity of the ID nodes which are not active and the activity of the relation of the ID nodes which are not active;

and cleaning the second ID relation network according to the activity after the updating of the inactive ID nodes and the activity after the updating of the relation of the inactive ID nodes, and acquiring a third ID relation network corresponding to the Tth day.

Specifically, only the ID node on the T-th day, the ID node relationship on the T-th day, and the ID relationship network on the T-1 th day have been screened, and the relationship between the ID node that is not active and the ID node that is not active within the preset time has not been considered.

And acquiring the relation between the inactive ID nodes and the inactive ID nodes in the preset time from a graph database constructed by the source ID data records. The preset time can be reasonably set according to the type of the ID node and the type of the ID node relation.

And updating the activity of the inactive ID node by using the attribute of the inactive ID node, wherein the calculation method of the activity of the ID node is the same as that described above, and is not repeated herein.

The activity of the inactive ID node relationship is updated by using the attribute of the inactive ID node relationship, and the method for calculating the activity of the ID node relationship is the same as that described above, and is not described herein again.

And comparing the updated activity of the ID nodes which are not activated with the node activity threshold value, and cleaning the ID nodes which are not activated and have activity smaller than the node activity threshold value.

And comparing the activity degree of the ID node relationship which is not activated after updating with a relationship activity degree threshold value, and cleaning the ID node relationship which is not activated and has the activity degree smaller than the relationship activity degree threshold value.

And acquiring a third ID relation network corresponding to the Tth day according to the second ID relation network which clears the relation between the inactive ID nodes and the inactive ID nodes.

After the relationship between the ID node that is not active and the ID node that is not active is cleared, it still needs to be considered whether a new relationship subnet is generated, and the determination of the one-ID of the new relationship subnet still needs to be considered.

And under the condition that the relation subnet in the second ID relation network is not split due to the inactive ID nodes or the cleaning of the relation of the inactive ID nodes, keeping the one-ID of the relation subnet unchanged, wherein the one-ID of the relation subnet in the third ID relation network is the one-ID of the relation subnet in the second ID relation network.

And under the condition that the relation subnet in the second ID relation network is split into a plurality of relation subnets due to the cleaning of the relation of the inactive ID nodes or the inactive ID nodes, selecting one relation subnet conforming to a preset rule from the plurality of relation subnets according to the preset rule to inherit the one-ID of the relation subnet in the second ID relation network, wherein the one-ID of other relation subnets is a new one-ID generated according to the relation between the ID node and the ID node. And updating the third ID relation network into the graph database, and deleting the ID relation sub-network with all the ID nodes deleted from the graph database.

And generating an identifier mapping dictionary corresponding to the Tth day according to the updated graph database.

The ID relationship network is cleaned according to the updated liveness, and the reliability, the accuracy and the stability of the ID relationship network are improved.

The method for realizing ID Mapping based on the graph database realizes the clearing of the overdue ID by clearing the ID nodes with the activity lower than the threshold value, solves the problem of ID overdue, realizes the clearing of the weak association relation among the ID nodes by disconnecting the ID node relation with the activity lower than the threshold value, solves the problems of ID multiplexing and ID complex relation, thereby improving the reliability, the accuracy and the stability of a user ID relation network

The device for implementing ID Mapping based on a graph database provided by the present invention is described below, and the device for implementing ID Mapping based on a graph database described below and the method for implementing ID Mapping based on a graph database described above may be referred to correspondingly.

Fig. 3 is a schematic structural diagram of an apparatus for implementing ID Mapping based on a graph database provided by the present invention, and as shown in fig. 3, the present invention further provides an apparatus for implementing ID Mapping based on a graph database, which includes: a first obtaining module 301, a second obtaining module 302, and a third obtaining module 303, wherein:

the first obtaining module 301 is configured to obtain, from a source ID data record, an ID node appearing on a tth day and an ID node relationship appearing on the tth day;

the second obtaining module 302 is configured to perform identification communication on the ID node appearing on the tth day, the ID node relationship appearing on the tth day, and the ID relationship network corresponding to the T-1 th day, and obtain a first ID relationship network corresponding to the tth day;

the third obtaining module 303 is configured to clean the first ID relationship network according to the activity of the ID nodes in the first ID relationship network and the activity of the ID node relationship, and obtain the second ID relationship network corresponding to the tth day.

Specifically, the apparatus for implementing ID Mapping based on a graph database provided in the embodiment of the present application can implement all the method steps implemented by the foregoing method embodiment, and can achieve the same technical effect, and detailed descriptions of the same parts and beneficial effects as those of the method embodiment in this embodiment are omitted here.

Fig. 4 is a schematic structural diagram of an electronic device provided in the present invention, and as shown in fig. 4, the electronic device may include: a processor (processor)410, a communication Interface 420, a memory (memory)430 and a communication bus 440, wherein the processor 410, the communication Interface 420 and the memory 430 are communicated with each other via the communication bus 440. The processor 410 may invoke logic instructions in the memory 430 to perform a method of implementing ID Mapping based on a graph database, the method comprising: acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record; carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to obtain a first ID relation network corresponding to the Tth day; and cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to obtain a second ID relational network corresponding to the Tth day.

In addition, the logic instructions in the memory 430 may be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

In another aspect, the present invention further provides a computer program product, the computer program product comprising a computer program, the computer program being stored on a non-transitory computer-readable storage medium, wherein when the computer program is executed by a processor, the computer is capable of executing the method for implementing ID Mapping based on a graph database provided by the above methods, the method comprising: acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record; carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to obtain a first ID relation network corresponding to the Tth day; and cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to obtain a second ID relational network corresponding to the Tth day.

In yet another aspect, the present invention also provides a non-transitory computer-readable storage medium having stored thereon a computer program, which when executed by a processor implements a method for implementing ID Mapping based on a graph database provided by the above methods, the method comprising: acquiring the relation between the ID node appearing on the Tth day and the ID node appearing on the Tth day from the source ID data record; carrying out identification communication on the ID node appearing on the Tth day, the ID node relation appearing on the Tth day and the ID relation network corresponding to the T-1 th day to obtain a first ID relation network corresponding to the Tth day; and cleaning the first ID relational network according to the activity of the ID nodes in the first ID relational network and the activity of the ID node relation to obtain a second ID relational network corresponding to the Tth day.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.

The terms "first," "second," and the like in the embodiments of the present application are used for distinguishing between similar elements and not for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application are capable of operation in other sequences than those illustrated or otherwise described herein, and that the terms "first" and "second" used herein generally refer to a class and do not limit the number of objects, for example, a first object can be one or more.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A method for realizing ID Mapping based on a graph database is characterized by comprising the following steps:

2. The method of claim 1, further comprising, before cleaning the first ID relationship network according to the activity of ID nodes and the activity of ID node relationships in the first ID relationship network:

3. The method according to claim 1, wherein the obtaining a second ID relationship network corresponding to the Tth day by cleaning the first ID relationship network according to the activity of ID nodes and the activity of ID node relationship in the first ID relationship network comprises:

4. The method according to claim 3, wherein said obtaining a second ID relationship network corresponding to Tth day according to the cleaned first ID relationship network comprises:

5. The method according to claim 1, wherein after the first ID relationship network is cleaned according to the activity of ID nodes and the activity of ID node relationship in the first ID relationship network and a second ID relationship network corresponding to the Tth day is obtained, the method further comprises:

6. The method according to claim 1, wherein said connecting the ID node appearing on the Tth day, the relationship among the ID nodes appearing on the Tth day, and the ID relationship network corresponding to the T-1 th day, and before obtaining the first ID relationship network corresponding to the Tth day, further comprises:

7. The method according to claim 1, wherein said connecting the ID nodes appearing on the Tth day, the relationship among the ID nodes appearing on the Tth day, and the ID relationship network corresponding to the T-1 th day, and after obtaining the first ID relationship network corresponding to the Tth day, further comprises:

8. An apparatus for implementing ID Mapping based on a graph database, comprising:

9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for implementing ID Mapping based on a map database according to any of claims 1 to 7 when executing the computer program.

10. A non-transitory computer readable storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements a method for implementing ID Mapping based on a graph database as claimed in any one of claims 1 to 7.