Solving graph routes into a set of possible relationship chains
AssigneeHewlett Packard Enterprise Development LP
InventorsMarco Aurelio Barbosa Fagnani Gomes Lotz, James Brook, Luis Miguel Vaquero Gonzalez
Life of this patent
Estimating the term…
Abstract
Example embodiments relate to solve a graph route into a set of possible relationship chains. The example disclosed herein receives a graph route, identifies an edge expansion wildcard based on the graph route, expands the graph route into a plurality of sub-graph routes based on the edge expansion wildcard, solves the plurality of sub-graph routes in parallel into a plurality of sub-graph routes results, and joins the plurality of sub-graph routes results into a set of possible relationship chains.
Claims20
A non-transitory machine-readable medium storing machine-readable instructions executable by a processor to cause the processor to:
- receive a graph route;
- identify an edge expansion wildcard based on the graph route;
- expand the graph route into a plurality of sub-graph routes based on the edge expansion wildcard;
- solve the plurality of sub-graph routes in parallel into a plurality of sub-graph routes results;
- and
- join the plurality of sub-graph routes results into a set of possible relationship chains.
A system comprising:
- a processor;
- a non-transitory machine readable medium storing machine readable instructions to cause the processor to:
- receive a graph route;
- identify an edge expansion wildcard based on the graph route;
- expand the graph route into a plurality of sub-graph routes based on the edge expansion wildcard, wherein the sub-graph route comprises at least a sub-graph route node, wherein the plurality of sub-graph routes is based on at least a sub-graph route;
- bind a node type hint into the sub-graph route node, wherein the node type hint is based on a graph topology file, wherein the node type hint indicates a node type of the sub-graph route node;
- solve the plurality of sub-graph routes in parallel into a plurality of sub-graph routes results;
- and
- join the plurality of sub-graph results into a set of possible relationship chains.
A method implemented by a computer system that includes a physical processor implementing machine readable instructions, the method comprising:
- receiving a graph route;
- identifying an edge expansion wildcard based on the graph route;
- expanding the graph route into a plurality of sub-graph routes based on the edge expansion wildcard, wherein the plurality of sub-graph routes is based on at least a sub-graph route;
- identifying a plurality of segments based on the subgraph route;
- solving the plurality of segments into a plurality of solved segments, wherein the plurality of segments are based on individual segments, wherein each individual segment is solved in parallel;
- determining a plurality of valid segments based on the plurality of solved segments;
- merging the plurality of valid segments into a merged plurality of valid segments;
- filtering redundant results within the merged plurality of valid segments into a sub-graph route result;
- and
- joining a plurality of sub-graph route results into a set of possible relationship chains.
Dependencies are inferred from the claim text.