Supercharge Your Innovation With Domain-Expert AI Agents!

Graph traversal algorithm based on distributed graph database

A graph traversal and database technology, applied in the field of graph traversal algorithms based on distributed graph databases, can solve the problems of high dependency and high overhead of computing nodes, and achieve the effect of alleviating network I/O efficiency and reducing network communication overhead.

Active Publication Date: 2022-07-29
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF16 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The present invention provides a graph traversal algorithm based on a distributed graph database, which solves the problem that the graph traversal process is highly dependent on computing nodes and has high overhead

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 algorithm based on distributed graph database
  • Graph traversal algorithm based on distributed graph database
  • Graph traversal algorithm based on distributed graph database

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] This embodiment 1 provides a graph traversal algorithm based on a distributed graph database, such as Figure 1-Figure 3 As shown, in this embodiment, the distributed graph database cluster specifically includes one gateway service node, one query control node, one metadata service node, four computing nodes, and four storage nodes. There are four partitions in each storage node, the above-mentioned partitions are storage partitions in the storage node, and having four partitions means that there are four storage partitions in each storage node.

[0050] On one of the four computing nodes above, through the query plan, an operator is generated and executed to sink to the storage node, set as a three-hop query (n1->n2->n3->n4), and the query operator Serialization. After the serialization is completed, the master node query is performed. Specifically, the metadata server is inquired about the storage node with a relatively small current load. The metadata server makes a...

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 graph traversal algorithm based on a distributed graph database, belongs to the technical field of distributed storage indexing, and solves the technical problems that in the prior art, an intermediate result of graph traversal needs to be kept by depending on a computing node, and the communication overhead is high, the graph traversal algorithm comprises the steps that A, the computing node sends a graph traversal request to a main node, the master node broadcasts the graph traversal request to other slave nodes; and B, after the master node and the slave node receive the graph traversal request, traversing all nodes stored by the master node and the slave node from the initial node meeting the condition to obtain NodeIDs, meeting the screening condition, of the master node and the slave node, and if the initial node meeting the condition does not exist, completing the local task of the storage node. The technical effects that the graph traversal request is pushed down to the storage layer, and the network communication overhead between the storage layer and the calculation layer in the graph traversal process is reduced are achieved.

Description

technical field [0001] The invention relates to the technical field of distributed storage indexes, in particular to a graph traversal algorithm based on a distributed graph database. Background technique [0002] With the vigorous development of various Internet applications, complex relationships under large-scale data have brought great challenges to traditional relational databases. In the traditional relational database field, to query other entities associated with a certain entity, or to continue to extend outward, database users need to write lengthy SQL statements, and database systems usually perform complex multi-table join operations. , the query performance is not ideal. The correlation query between such data becomes the relational number query. The emergence of graph database can well solve the performance bottleneck of entity association query faced by relational database, and promote the development of database system field. [0003] In the current distri...

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/22G06F16/27
CPCG06F16/2237G06F16/27Y02D10/00
Inventor 段翰聪李林张建王书涵陈铎汝李世豪邹涛李涛
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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