Distributed graph databases that facilitate streaming data insertion and queries by reducing number of messages required to add a new edge by employing asynchronous communication

A machine, comprising:

• a processor, operatively coupled to at least one memory, to execute the following computer executable components stored in the memory:
• a graph database component that:
• generates a quantity of queue pairs equal to a quantity of queue pairs equal to a quantity of shards for which there are a plurality of requests to add vertices to the shards at a plurality of machines comprising the machine, wherein each queue pair comprises an outgoing edge queue and an incoming edge queue, and wherein the plurality of machines are associated with a distributed graph database;
• places respective outgoing edge requests corresponding to the vertices in associated outgoing edge queues for the shards associated with the vertices;
• places respective incoming edge requests corresponding to the vertices in associated incoming edge queues for the shards associated with the vertices;
• generates respective bulk requests for the shards to generate source vertices corresponding to the vertices;
• and
• processes the bulk requests, the outgoing edge requests, and the incoming edge requests to generate respective tuples for outgoing edges and incoming edges for the vertices.

A computer program product that reduces number of messages to add a new edge to a distributed graph database across a plurality of machines by employing asynchronous communication, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing component of a machine of the plurality of machines to cause the processing component to:

• generate a quantity of queue pairs equal to a quantity of queue pairs equal to a quantity of shards for which there are a plurality of requests to add vertices to the shards at a plurality of machines, wherein each queue pair comprises an outgoing edge queue and an incoming edge queue;
• place respective outgoing edge requests corresponding to the vertices in associated outgoing edge queues for the shards associated with the vertices;
• place respective incoming edge requests corresponding to the vertices in associated incoming edge queues for the shards associated with the vertices;
• generate respective bulk requests for the shards to generate source vertices corresponding to the vertices;
• and
• process the bulk requests, the outgoing edge requests, and the incoming edge requests to generate respective tuples for outgoing edges and incoming edges for the vertices.