Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and device for realizing graph node attribute storage for shortest path problem

A technology of the shortest path and implementation method, which is applied in other database retrieval, other database indexing, special data processing applications, etc., can solve problems such as low graph calculation performance, large randomness and irregularity of attribute arrays, and reduce random reads The number of times, hardware logic to achieve simple effects

Active Publication Date: 2021-12-17
NAT UNIV OF DEFENSE TECH
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The update process involves repeated reading and writing of attribute arrays. Usually, the access to attribute arrays is relatively random and irregular, resulting in low graph computing performance.

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 graph node attribute storage for shortest path problem
  • Method and device for realizing graph node attribute storage for shortest path problem
  • Method and device for realizing graph node attribute storage for shortest path problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Such as figure 1 As shown, the implementation steps of the implementation method of the graph node attribute memory oriented to the shortest path problem in this embodiment include:

[0034] 1) Obtain the access operation for the graph node attribute storage, the graph node attribute storage includes a plurality of graph node attribute memory cells, when the access operation is the graph node attribute initialization operation, jump to step 2), when Jump to step 3) when the access operation is a graph node attribute write operation, and jump to step 4) when the access operation is a graph node attribute read operation;

[0035] 2) Execute the graph node attribute initialization operation for the specified graph node attribute memory unit cell, initialize the source node attribute value to 0, initialize the non-source node attribute value to a maximum value, end and exit;

[0036] 3) Execute the graph node attribute write operation for the specified graph node attribute...

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 device for realizing a graph node attribute memory for the shortest path problem. The graph node attribute memory of the present invention includes a plurality of graph node attribute memory units; each memory unit includes a graph node attribute Initialization, node attribute write success, read success mechanism; graph node attribute initialization, source node attribute value is initialized to 0, non-source node attribute value is initialized to positive infinity (all binary bits in the storage data area are initialized to all 1s); The node attribute writing is successful, if and only when the attribute value of the node to be written is less than or equal to the node attribute value in the memory, the writing can be successful, otherwise the write operation is ignored; the graph node attribute read, for the node attribute storage unit A read operation returns the node attribute data immediately. The present invention implements a method for realizing a graph node attribute memory for the shortest path problem, and reduces the impact of random read operations on performance.

Description

technical field [0001] The invention relates to a storage technology for a graph calculation problem, in particular to a method and device for realizing a graph node attribute memory facing the shortest path problem. Background technique [0002] The graph computing problem is a typical memory-intensive problem, which has the characteristics of unbalanced load, irregular memory access, low computing-memory ratio, and poor locality. A typical graph computing problem involves setting an attribute for each graph node, and the goal of problem solving is to calculate the attribute value corresponding to each node. For example, for the single-source shortest path problem, given the source node S, calculate the shortest distance from the source node S to all graph nodes, where the attribute value is the distance from the node to the source node; for width-first The search problem is to give a root node R and calculate a breadth-first search tree with node R as the root. The attrib...

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/901
CPCG06F16/9024
Inventor 雷国庆郑重王俊辉郭维郭辉隋兵才黄立波孙彩霞倪晓强王永文
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com