Key-value pair storage methods for graph data and graph data prefetching methods

A graph data prefetching method, comprising:

• receiving a graph data read request for a graph database, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprises identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges;
• determining a key in a key-value pair of a matched graph composition element in the graph composition elements and a storage address of a key-value pair of a graph composition element in the graph composition elements corresponding to the matched graph composition element;
• and
• retrieving, based on a prefetching address range that matches the storage address, a key-value pair stored in the prefetching address range.

An electronic device, comprising:

• at least one processor;
• and
• one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:
• obtaining key-value pairs of graph composition elements, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprises identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges;
• and
• storing the key-value pairs in order based on an arrangement sequence of category identifiers comprised in the keys.