Data processing method and system of a distributed graph database
AssigneeVesoft. Inc
InventorsTong YUE, Bosheng CHEN, Xiaomeng YE
Life of this patent
Estimating the term…
Abstract
The present application relates to a data processing method and system of a distributed graph database. The present application solves the problem of how to improve the efficiency of adding, deleting, modifying and checking data in a graph database, realizes balanced storage and concurrent computing of distributed index, reduces network overhead caused by data operation, and improves the efficiency of data operation effectively.
Claims20
A data processing method of a distributed graph database, comprising:
- obtaining a write request of a Vertex or an Edge;
- generating a Vertex Index of the Vertex according to a TagID of the Vertex, wherein, the Vertex comprises a VertexID and the TagID;
- writing the Vertex and the Vertex Index into a same Graph Partition by performing a hash operation on the VertexID and storing the Vertex and the Vertex Index in the Graph Partition;
- generating an Edge Index of the Edge according to an EdgeType of the Edge, wherein, the Edge comprises a Source VertexID and the EdgeType;
- writing the Edge and the Edge Index into same Graph Partition by performing a hash operation on the Source VertexID and storing the Edge and the Edge Index in the Graph Partition;
- obtaining a data update request of the Vertex or the Edge, wherein, the data update request comprises a data record to be updated and data update information;
- detecting whether the data record is valid;
- returning update failure information if the data record is invalid;
- and
- updating the Vertex or the Edge according to the data update information if the data record is valid.
A data processing system of a distributed graph database, comprising a Graph Server, a Meta Server, and a Storage Server;
- wherein:
- the Graph Server obtains a write request of a Vertex or an Edge;
- the Meta Server generates a Vertex Index of the Vertex according to a TagID of the Vertex, wherein, the Vertex comprises a VertexID and the TagID, and writes the Vertex and the Vertex Index into a same Graph Partition by performing a hash operation on the VertexID;
- the Storage Server stores the Vertex and the Vertex Index in the Graph Partition;
- the Meta Server generates an Edge Index of the Edge according to an EdgeType of the Edge, wherein, the Edge comprises a Source VertexID and the EdgeType, and writes the Edge and the Edge Index into a same Graph Partition by performing hash a operation on the Source VertexID;
- the Storage Server stores the Edge and the Edge Index in the Graph Partition;
- the Graph Server obtains a data update request of the Vertex or the Edge, wherein, the data update request comprises a data record to be updated and data update information;
- the Storage Server detects whether the data record is valid;
- the Storage Server returns update failure information if the data record is invalid;
- and
- the Storage Server updates the Vertex or the Edge according to the data update information if the data record is valid.
Dependencies are inferred from the claim text.