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

Graph traversal memory access optimization method and system based on Hybrid storage format and electronic equipment

A storage format and optimization method technology, applied in the field of graph computing, can solve problems such as large memory consumption and array overflow

Active Publication Date: 2021-05-18
SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to solve the technical problems existing in the prior art, to provide a graph traversal and memory access optimization method, system and electronic equipment based on the Hybrid storage format, which can effectively solve the problem of the data structure of various existing storage graphs. In the traversal algorithm, there are problems such as too much memory consumption or array overflow

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
  • Graph traversal memory access optimization method and system based on Hybrid storage format and electronic equipment
  • Graph traversal memory access optimization method and system based on Hybrid storage format and electronic equipment
  • Graph traversal memory access optimization method and system based on Hybrid storage format and electronic equipment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0061] In order to facilitate the understanding of the present invention, the present invention will be described more fully below with reference to the associated drawings. Preferred embodiments of the invention are shown in the accompanying drawings. However, the present invention can be embodied in many different forms and is not limited to the embodiments described herein. On the contrary, these embodiments are provided to make the understanding of the disclosure of the present invention more thorough and comprehensive.

[0062] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the technical field of the invention. The terms used herein in the description of the present invention are for the purpose of describing specific embodiments only, and are not intended to limit the present invention.

[0063] refer to figure 1 As shown, the present invention also provides a graph trav...

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 relates to the technical field of graph calculation, and discloses a graph traversal memory access optimization method and system based on a Hybrid storage format and electronic equipment. The optimization method comprises the following steps: randomly generating an adjacent matrix AM of stored graph data; performing graph data processing on the adjacent matrix AM to generate a matrix hybrid in a new storage format; and finally, according to the generated matrix hybrid in the new storage format, performing BFS search to complete breadth-first search of the graph. According to the method and system, a matrix hybrid in a new storage format is adopted to store graph data, so that the problems of too large memory consumption or array overflow and the like existing in a graph traversal algorithm of various existing data structures for storing graphs are effectively solved.

Description

technical field [0001] The present invention relates to the technical field of graph computing, and more specifically, to a graph traversal and memory access optimization method, system and electronic device based on a Hybrid storage format. Background technique [0002] Graph is a very important data structure. In reality, many problems can be abstracted and reduced into graph computing problems before further processing. In practice, the full graph is rarely used, and the application of dense graphs is relatively rare. In reality, most graphs are sparse graphs, especially the graphs involved in large-scale graph calculations are extremely sparse. [0003] Breadth-First Search algorithm (Breadth-First Search, BFS) is a classic algorithm of graph computing, and it is also a graph computing method of blind search. point to start the expansion of the system and traverse all vertices in the graph until a result is found. BFS is one of the easiest graph traversal algorithms an...

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
IPC IPC(8): G06F16/901
CPCG06F16/9024
Inventor 刘树珍周家秀孟金涛魏彦杰冯圣中
Owner SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
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