| CPC G06F 16/9035 (2019.01) [G06F 16/9024 (2019.01); G06F 16/51 (2019.01); G06F 16/535 (2019.01); G06F 16/5866 (2019.01)] | 17 Claims |

|
1. A computer-implemented method for querying graph data, comprising:
receiving a query request, wherein the query request comprises a filtering condition for an attribute value of a first attribute, and the query request is used to query a destination edge in a neighboring edge of a first node that satisfies the filtering condition, wherein:
graph data comprises point data of the first node and edge data of a neighboring edge of the first node;
both point data and edge data is stored in a single-point data block corresponding to the first node;
the single-point data block comprises index data of the edge data;
the index data is used to index a first attribute of the edge data;
the index data records the attribute value of the first attribute;
the index data further records a storage location of an edge corresponding to the attribute value of the first attribute in the single-point data block; and
the index data is located in a first index block, the first index block is any of a plurality of index blocks comprised in the single-point data block, and the plurality of index blocks are respectively used to index a plurality of attributes of the edge data, the single-point data block comprises positioning data, and wherein the positioning data records a storage location of each of the plurality of index blocks in the single-point data block;
determining, based on the index data and the filtering condition, a storage location of the destination edge in the single-point data block; and
obtaining, based on the storage location of the destination edge in the single-point data block, data of the destination edge.
|