Parallel graph events processing
Abstract:
A computer-implemented method for processing an update event for a target graph may be provided. The method comprises upon an event broker receiving a vertex update event, assigning the vertex update event to a compute node which processes update events for the vertex. Upon the event broker receiving an update event targeting a linking edge in the target graph, performing by the event broker: dividing the update event into a pair of create-if-not-exist sub-events, and an edge update sub-event, assigning the first create-if-not-exist sub-event to a first compute node, and integrating the first create-if-not-exist sub-event into a stream of update events for the first vertex. The same happens for the second vertex. The edge update sub-event is assigned to a third compute node, and integrates into the edge update sub-event stream.
Public/Granted literature
Information query
Patent Agency Ranking
0/0