Skip relation pattern for graph structures
First Claim
1. A computer implemented method for efficiently filtering graphs comprising:
- applying a filter to a graph structure that includes nodes and relations between the nodes;
evaluating the graph structure according to the filter; and
replacing a first of the nodes that does not satisfy the filter with a first skip node.
1 Assignment
0 Petitions
Accused Products
Abstract
Systems and processes may apply a filter to data in a graph structure using an interface. The filter may be applied upon request from a business application. The interface may determine which portions of the graph structure satisfy the filter criteria. The interface may replace nodes and/or relations that do not satisfy filter criteria with skip nodes or functions. For example, software can be operable to apply a filter to a graph structure that includes nodes and relations between the nodes and evaluating the graph structure according to the filter. The software then replaces a first of the nodes that does not satisfy the filter with a first skip node.
-
Citations
18 Claims
-
1. A computer implemented method for efficiently filtering graphs comprising:
-
applying a filter to a graph structure that includes nodes and relations between the nodes; evaluating the graph structure according to the filter; and replacing a first of the nodes that does not satisfy the filter with a first skip node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. Software for efficiently filtering graphs comprising computer readable instructions embodied on media and operable to:
-
apply a filter to a graph structure that includes nodes and relations between the nodes; evaluate the graph structure according to the filter; and replace a first of the nodes that does not satisfy the filter with a first skip node. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A system for efficiently filtering graphs comprising:
-
means for applying a filter to a graph structure that includes nodes and relations between the nodes; means for evaluating the graph structure according to the filter; and means for replacing a first of the nodes that does not satisfy the filter with a first skip node. - View Dependent Claims (18)
-
Specification