Change monitoring spanning graph queries

A system for improving computational efficiency in monitoring changes to a relationship graph, comprising:

• a processor;
• and
• a memory storage device, including instructions that when executed are operable to:
• maintain a membership array;
• receive a member node identifier, and in response record the member node identifier in the membership array;
• receive a candidate node identifier, and in response determine whether the candidate node identifier is recorded in the membership array;
• in response to determining that the candidate node identifier is recorded in the membership array:
• run a graph query to produce a view of the relational graph;
• compare the view to a prior view of the relational graph produced by the graph query to determine whether the query is affected by a change to the relational graph;
• and
• in response to the view and the prior view not matching, expose the change to the relational graph to a client.

A computer readable storage device including instructions for improving computational efficiency in monitoring changes to a relationship graph, comprising:

• receiving, from a client device, a graph query at a graph server hosting the relational graph;
• running the graph query to span the relational graph to produce a view of the relational graph;
• associating an AMQ filter with the graph query, including:
• initializing a membership array comprising a plurality of bits, wherein each bit is set to a first state;
• receiving identifiers for nodes spanned by the graph query;
• hashing the identifiers to produce positional values for each of the identifiers, wherein the positional values each identify a bit at a position in the membership array;
• and
• recording the nodes in the membership array by setting one or more bits of the plurality of bits to a second state, wherein the one or more bits set to the second state correspond to the positional values;
• receiving, at the graph server, a change stream affecting the relational graph, the change stream including a given node that has been changed;
• querying the AMQ filter with the given node, including:
• receiving a given identifier for the given node;
• hashing the given identifier to produce candidate positions for the given node in the membership array;
• and
• determining a state to which each bit at the candidate positions in the membership array is set;
• and
• in response to determining that any bit at the candidate positions in the membership array is set to the first state, preventing the graph query from being rerun.