Method and device for realizing ID Mapping based on graph database

A database and data recording technology, which is applied in the field of big data, can solve the problems of low reliability, low accuracy, and low stability of user ID relationship networks, solve the problems of ID reuse and complex ID relationships, and improve reliability effect

Pending Publication Date: 2022-08-09
邦道科技有限公司
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The present invention provides a method and device for realizing ID Mapping based on a graph database, which are used to solve the defects of low reliability, low accuracy and low stability of the user ID relationship network in the prior art, and realize ID expiration, Effective processing of ID multiplexing and ID complex relationships, improving the reliability, accuracy and stability of user ID relationship networks

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
  • Method and device for realizing ID Mapping based on graph database
  • Method and device for realizing ID Mapping based on graph database
  • Method and device for realizing ID Mapping based on graph database

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0047] The dictionary method of ID Mapping is the simplest among the three types of methods. In the dictionary method of ID Mapping, the ID in the source data is represented by the keyword (key), and the generated unified one-ID is represented by the value (value). The process is to determine whether the extracted ID is in the key. 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. The ID connection may be generated as the ID increases, so it is also necessary to merge the dictionary, that is, merge the IDs that already have an ID relationship but have not established an inter-ID connection.

[0048] The advantage of the dictionary method of ID Mapping is that it is simple in principle, easy to implement, and has high processing efficiency; the disadvantage is that it cannot solve the problem of ID expiration and reuse and the complex relationship between IDs. For example, when there are mu...

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 invention provides a method and a device for realizing ID Mapping based on a graph database. The method comprises the following steps: acquiring a relationship between ID nodes appearing on the Tth day and ID nodes appearing on the Tth day from a source ID data record; performing identification connection 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 obtaining a first ID relationship network corresponding to the Tth day; and cleaning the first ID relationship network according to the activeness of the ID nodes in the first ID relationship network and the activeness of the ID node relationship, and obtaining a second ID relationship network corresponding to the Tth day. According to the method and the device, the expired IDs are cleaned by cleaning the ID nodes of which the activeness is lower than the threshold value, and the weak association relationship of the ID nodes is cleaned by disconnecting the ID node relationship of which the activeness is lower than the threshold value, so that the reliability, the accuracy and the stability of the user ID relationship network are improved.

Description

technical field [0001] The invention relates to the technical field of big data, and in particular, to a method and device for implementing ID Mapping based on a graph database. Background technique [0002] In real life, users can obtain services provided by enterprises through a variety of devices and from various portals; enterprises can also develop a variety of business lines, form a variety of products, and can provide users from different channels. Provide services, so the data of the same user comes from different data sources, and the data is diverse and scattered in various locations. [0003] The big data platform physically solves the "data island" problem of data scattered in various locations, but logically, it is difficult to establish correlation between data from multiple different sources, and the data is still fragmented, which leads to Constructing a one-sided portrait of a user with a single or very little data is equivalent to "blind man touching an el...

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 Applications(China)
IPC IPC(8): G06F16/901G06F16/215G06F16/23
CPCG06F16/9024G06F16/215G06F16/23
Inventor 朱贺贺李锐佳周建宏朱文俊文朝
Owner 邦道科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products