Method and device for obtaining multi-hop neighbor node

A technology of neighbor node and acquisition method, applied in the computer field, can solve the problems of network congestion, reduce the computing efficiency of multi-hop neighbor nodes, etc., and achieve the effect of improving computing efficiency

Active Publication Date: 2017-05-24
HONOR DEVICE CO LTD
View PDF5 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, the existing BFS method for calculating multi-hop neighbors will generate a large amount of network communication costs, especially for some dense graphs or power-law graphs. A large amount of information transmission will cause network congestion, which will reduce the cost of querying multi-hop neighbors in large graphs. Node Computational Efficiency

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 obtaining multi-hop neighbor node
  • Method and device for obtaining multi-hop neighbor node
  • Method and device for obtaining multi-hop neighbor node

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0057] Embodiments of the present invention provide a method and device for obtaining multi-hop neighbor nodes, which are used to improve the computational efficiency of querying multi-hop neighbor nodes in a large graph.

[0058] In order to make the purpose, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the following The described embodiments are only some, not all, embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention belong to the protection scope of the present invention.

[0059] The terms "first", "second" and the like in the description and claims of the present invention and the above drawings are used to distinguish similar obj...

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 discloses a method and a device for obtaining a multi-hop neighbor node. The method and the device are used for improving the calculation efficiency of inquiring the multi-hop neighbor node in a big graph. The method for obtaining the multi-hop neighbor node comprises the steps of obtaining a zero-hop neighbor of each node in a topological network to obtain a full node zero-hop neighbor set; when a first node serves as an appointed node, calculating a k+1-hop neighbor set of the first node through an iterative calculation process below, wherein the iterative calculation process comprises a step a of obtaining the k-hop neighbor set of the first node and a step b of connecting the k-hop target node in the k-hop neighbor set of the first node and two node pairs with the same initial nodes in the full node zero-hop neighbor set into a node pair, and obtaining the k+1-hop neighbor set of the first node after the connection of the node pair is finished; and when the hop number k+1 of the k+1-hop neighbor set of the first node is equal to kmax, outputting the k+1-hop neighbor set of the first node and a corresponding k+1 hop path.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method and device for acquiring multi-hop neighbor nodes. Background technique [0002] A social network is a network of connected individuals and organizations. Now there are many social networks, such as Facebook, Twitter, paper citation network, Skype communication network, blog network and Renren, etc., showing a prosperous scene. In a social network, a vertex represents an object. For example, a paper, a sensor, a person, etc. can be used as a vertex. Edges represent the relationship between vertices. The relationship can include cooperative papers, friends, teachers, etc. Student relationship, citation relationship of papers, etc. [0003] Multi-hop neighbors have a wide range of applications on large graphs, such as community discovery, advertisement recommendation or friend recommendation, link prediction, finding friends of friends, and so on. On a large graph, a ...

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): H04L12/24H04L12/751H04L45/02
CPCH04L41/12H04L45/02
Inventor 刘文洁刘潭义张晓飞陈雷
Owner HONOR DEVICE CO LTD
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