Abstract: Relation network data query includes receiving a query request for an edge using a first node as a starting node, where the edge satisfies a specified filter condition comprising that the edge has a first edge data item and a corresponding first data value. Multiple index blocks associated with the first node are obtained from a non-volatile storage storing a relation network. A first index block corresponding to the first edge data item is determined from the multiple index blocks based on a correspondence between an index block and an edge data item, where the first index block comprises multiple data values of the first edge data item and location information of edges having the multiple data values and using the first node as starting nodes. Location information of an edge having the corresponding first data value is determined from the first index block and the edge obtained.

Abstract: Computer-implemented methods, apparatus, and systems for data storage and data query are described. During data storage, the number of neighboring graph nodes in each starting graph node in directed graph graph data to be stored is determined, and a data storage mode is determined according to the number of neighboring graph nodes. When the data storage mode is not an ultra-large node data storage, node data, neighbor information, outgoing edge index feature information, and outgoing edge data of the starting graph node are stored in the same data fragment. When the data storage mode is an ultra-large node data storage, node data, neighbor information, outgoing edge index feature range information, and outgoing edge data are stored in a starting graph node data fragment, and the outgoing edge data and outgoing edge data storage address information of the starting graph node are stored in at least two outgoing edge data fragments.

Abstract: A query request is received for querying graph data, including a filtering condition for an attribute value of a first attribute, and used to query a destination edge in a neighboring edge of a first node that satisfies the filtering condition. Graph data includes point data of the first node and edge data of a neighboring edge stored in a single-point data block corresponding to the first node and comprising index data of the edge data used to index a first attribute of the edge data, record the attribute value of the first attribute, and record a storage location of an edge corresponding to the attribute value of the first attribute in the single-point data block. Using the index data and filtering condition, a storage location of the destination edge in the single-point data block is determined and data of the destination edge obtained.