Unlock instant, AI-driven research and patent intelligence for your innovation.

Data association method, electronic device and medium

A data association and data technology, applied in the field of data processing, can solve problems such as poor stability, difficult calculation, and low calculation efficiency, and achieve the effect of stable data association and merger, and extensive use value

Active Publication Date: 2021-08-24
上海嗨普智能信息科技股份有限公司
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] However, when the amount of user data is too large, due to the limitation of computing power, traditional stand-alone-based data association algorithms will have computational difficulties, low computing efficiency, and poor stability. If the single-machine computing power is expanded and upgraded, the marginal cost will be greatly increased.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data association method, electronic device and medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0026] Step S3 may specifically include: Step S31, reading the data and the data associated with the data one by one, establishing an edge between any two vertices of the associated data until each of the vertices associated with other data The vertices of the data are connected with at least one edge to obtain the association graph.

[0027] Based on the association graph constructed in Embodiment 1, step S4 may include:

[0028] Step S41, traversing the ids of all vertices in the association graph, each vertex transmits the id of this vertex to an adjacent vertex, receives the ids of all adjacent vertices at the same time, and obtains the ids of all adjacent vertices currently received by this vertex and The minimum or maximum value in the id of this vertex, and update it to the id of this vertex;

[0029] Step S42, multiple iterations until the ids of all vertices no longer change;

[0030] Step S43, merging all data with the same id into associated data.

[0031] It can...

Embodiment 2

[0033] Step S3 may specifically include:

[0034] Step S321, in the data with associated relationship corresponding to each record, select a vertex of the target data as the central vertex of the record, traverse all the vertices of the data corresponding to the record, and collect all the vertexes of the target data related to the record The id of the vertex of the data of the association relationship is updated to the id of the central vertex of the record and connected to the central vertex of the record, the sub-association graph corresponding to the record is generated, and all the records are traversed until the sub-associations corresponding to all the records are generated Graph to get the correlation graph.

[0035] Based on the association graph constructed in Embodiment 2, step S4 may include:

[0036] Step S421, traversing the ids of all vertices in the association graph, each vertex transmits the id of this vertex to an adjacent vertex, receives the ids of all ad...

Embodiment 3

[0041] Step S3 may specifically include:

[0042]Step S331: Among the associated data corresponding to each record, select a vertex of the target data as the starting vertex of the record, traverse all the vertices of the data corresponding to the record, and combine all the target data of the record The id of the vertex of the data with the associated relationship is updated to the start vertex id of the record and sequentially connected in series to generate a sub-association graph corresponding to the record, and traverse all the records until the sub-association graph corresponding to all the records is generated, Obtain the association graph. Based on the association graph constructed in the third embodiment, step S4 may include: step S431, traversing the ids of all vertices in the association graph, each vertex transmits the id of this vertex to an adjacent vertex, and simultaneously receives the ids of all adjacent vertices , Obtain the ids of all adjacent vertices cur...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention relates to a data association method, electronic equipment and media. The method includes acquiring multiple records from multiple databases, each of the records includes a plurality of associated data; reading each of the records one by one Each of the data, and traverse all the read data to determine whether there is the same data as the currently read data in the read data, and if so, assign the read data to the currently read data The id of the same data, otherwise, assign the current maximum id to the currently read data; take all the data as vertices, traverse all the ids of the data, connect the vertices of the data with the same id, and merge them into one Vertices, and then use the association relationship as an edge to establish an association graph; perform data association based on the association graph. The invention improves the speed and stability of the data association process, and has low cost.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a data association method, electronic equipment and media. Background technique [0002] User data is usually distributed in multiple data sources. In many data application scenarios, such as the establishment of user portraits, personalized recommendations, and report calculations, it is often necessary to organize and merge user data from multiple data sources. User data is associated. [0003] However, when the amount of user data is too large, due to the limitation of computing power, traditional stand-alone-based data association algorithms will have computational difficulties, low computing efficiency, and poor stability. If the single-machine computing power is expanded and upgraded, the marginal cost will be greatly increased. . Therefore, how to provide a low-cost, fast and stable data association technology has become an urgent technical problem to be solved. ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/903G06F16/908
CPCG06F16/90335G06F16/908
Inventor 蔡文渊张坤坤岳彤
Owner 上海嗨普智能信息科技股份有限公司