Method, apparatus, device and storage medium for generating and processing a distributed graph database

A data processing method for a distributed graph database, wherein the distributed graph database comprises a calculation node and storage nodes, the data processing method comprises the following steps:

• setting a UUID for each storage node according to:
• receiving a UUID generation request, wherein the UUID generation request comprises an input field and a partition number of the input field;
• calling a Murmur hash function to generate an initial UUID according to the input field and the partition number of the input field;
• querying whether a duplicate key value exists between the initial UUID and a historical UUID to obtain a query result;
• obtaining a target UUID for storage according to the query result and the initial UUID;
• obtaining a write request of a user, and receiving and parsing the write request by the calculation node;
• after the write request is parsed, calculating a UUID of write information corresponding to the write request by the calculation node, determining a first storage node according to the UUID of the write information, wherein the write information is located on the first storage node, and generating a storage command, wherein the storage command further comprises:
• obtaining a query instruction, and receiving and parsing the query instruction by the calculation node;
• after the query instruction is parsed, calculating a UUID of query information corresponding to the query instruction by the calculation node, determining a second storage node according to the UUID of the query information, wherein the query information is located on the second storage node, and generating a query request;
• sending the query request to the second storage node by the calculation node, and extracting the query information according to the query request by the second storage node, and returning the query information to the calculation node;
• obtaining the query information corresponding to the query instruction by the calculation node, and then returning the query information to the user;
• and
• sending the storage command to the first storage node by the calculation node, and storing the write information according to the storage command by the first storage node.

A UUID generation apparatus for a distributed graph database, comprising:

• a processor coupled to a memory storing instructions to:
• receive a UUID generation request, wherein the UUID generation request comprises an input field and a partition number of the input field;
• call a Murmur hash function to generate an initial UUID according to the input field and the partition number of the input field;
• query whether a duplicate key value exists between the initial UUID and a historical UUID to obtain a query result;
• obtain a target UUID for storage according to the query result and the initial UUID;
• obtain a write request of a user, and receiving and parsing the write request by the calculation node;
• after the write request is parsed, calculate a UUID of write information corresponding to the write request by the calculation node, determine a first storage node according to the UUID of the write information, wherein the write information is located on the first storage node, and generate a storage command, wherein the storage command further comprises:
• obtain a query instruction, and receiving and parsing the query instruction by the calculation node;
• after the query instruction is parsed, calculate a UUID of query information corresponding to the query instruction by the calculation node, determining a second storage node according to the UUID of the query information, wherein the query information is located on the second storage node, and generate a query request;
• send the query request to the second storage node by the calculation node, and extract the query information according to the query request by the second storage node, and return the query information to the calculation node;
• obtain the query information corresponding to the query instruction by the calculation node, and then return the query information to the user;
• and
• send the storage command to the first storage node by the calculation node, and store the write information according to the storage command by the first storage node.