Graph data storage method and device, graph data processing method and device and computer storage medium

Abstract

The embodiment of the invention discloses a graph data storage method and device, a graph data processing method and device and a computer storage medium, and belongs to the technical field of graph databases. The method comprises the steps of acquiring target vertex sequence numbers of target vertexes stored in a target partition, storing a plurality of vertexes in the target partition, wherein the vertexes correspond to the vertex sequence numbers respectively; obtaining a partition number of a partition where the other vertex of each edge in one or more edges associated with the target vertex is located, a vertex sequence number of the other vertex and the direction of each edge, and obtaining target edge data corresponding to the target vertex sequence number; and writing the target edge data into a side data file in the target partition, wherein the side data file is used for storing side data corresponding to each vertex sequence number. According to the embodiment of the invention, the partition numbers of the partitions where the vertexes are located and the vertex sequence numbers of the vertexes in the partitions are used as identifiers, so that the memory required for graph calculation is reduced, and the calculation performance of the calculation nodes is improved.

Description

technical field [0001] The embodiments of the present application relate to the technical field of graph databases, and in particular to a graph data storage and processing method, device, and computer storage medium. Background technique [0002] A graph database is a non-relational database that uses graphs such as vertices and edges to represent entities and the relationships between entities. Among them, a vertex in a graph database indicates an entity, and an edge between two vertices indicates a relationship between the two entities. Entities can represent objects in real life, and relations can represent the connections between different objects. The data stored in the graph database may be referred to as graph data, and the graph data includes vertex data and edge data. Among them, the data of the vertex is used to indicate the relevant information of the entity, and the data of the edge is used to indicate the relevant information of the relationship. In addition...

AI Technical Summary

Problems solved by technology

In this scenario, if the storage space occupied by the ID of the vertex is large, the storage space occupied by the key value of the vertex itself and the key value of the edge corresponding to the vertex is relatively large.

In this way, the graph data loaded into the memory will occupy a large memory space, thereby affecting the computing performance of the computing nodes

Images