Graph data storage method and device

Abstract

The invention provides a graph data storage method and device.The method comprises the steps that vertex data and edge data are determined according to a graph structure of a target business, the vertex data comprise vertex reference identifiers of all vertexes, and the edge data comprise edge reference identifiers of all edges; the vertex reference identifiers of the vertexes and the edge reference identifiers of the edges are stored in the fixed-length data segments respectively, the lengths of the fixed-length data segments storing the vertex reference identifiers of the vertexes are the same, and the lengths of the fixed-length data segments storing the edge reference identifiers of the edges are the same; and forming identifiers of the vertexes according to the storage positions of the vertexes in the file, and establishing an index tree of a graph structure by combining the identifiers of the vertexes. According to the method and the device, the vertex reference identifier and the edge reference identifier are stored in the fixed-length data segment, the dynamic multiplexing of the storage space is realized, and the identifier of each vertex is formed through the storage position of the vertex, so that each vertex has ID invariance, and the positioning efficiency of the data is improved.

Description

technical field [0001] The invention relates to the technical field of data storage, in particular to a method and device for storing graph data. Background technique [0002] With the explosive development of the Internet, mobile Internet, social network, Internet of Things and related networks in the industrial field such as power networks, there is a great demand for the storage of relationship graphs and applications such as network topology analysis and functional analysis based on relationship graphs. At the same time, it also contributed to the upsurge of research and development of graph databases. When large-scale relational network data needs to be stored, it will take up a large space, and there are problems such as data reading delay and low writing efficiency. Contents of the invention [0003] Therefore, the technical problem to be solved by the present invention is to overcome the defect of large space occupied when storing graph relational networks in the ...

AI Technical Summary

Problems solved by technology

[0003] Therefore, the technical problem to be solved by the present invention is to overcome the defect of large space occupied when storing graph relational networks in the prior art, thereby providing a graph data storage method and device

Images