Methods and apparatuses for storing graph data of a relationship network graph

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform one or more operations for graph data storage, comprising:

• acquiring connection relationship information between any two nodes in a relationship network graph, wherein the relationship network graph comprises a directed connecting edge between nodes;
• based on the connection relationship information, storing a first mapping relationship between an identifier of each node in the relationship network graph and a node identifier of an outgoing edge-connected node of the node in a compressed sparse row format, and storing a second mapping relationship between the identifier of each node and a node identifier of an incoming edge-connected node of the node in a compressed sparse column format;
• acquiring a set of attribute information in the relationship network graph, wherein the set of attribute information comprises several node attributes, several edge attributes, and/or several pieces of temporary information;
• and
• storing, using column storage, each attribute value of a same attribute in the set of attribute information in continuous space.

A computer-implemented system for graph data storage, comprising:

• one or more computers;
• and
• one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations, comprising:
• acquiring connection relationship information between any two nodes in a relationship network graph, wherein the relationship network graph comprises a directed connecting edge between nodes;
• based on the connection relationship information, storing a first mapping relationship between an identifier of each node in the relationship network graph and a node identifier of an outgoing edge-connected node of the node in a compressed sparse row format, and storing a second mapping relationship between the identifier of each node and a node identifier of an incoming edge-connected node of the node in a compressed sparse column format;
• acquiring a set of attribute information in the relationship network graph, wherein the set of attribute information comprises several node attributes, several edge attributes, and/or several pieces of temporary information;
• and
• storing, using column storage, each attribute value of a same attribute in the set of attribute information in continuous space.