Graph processing system that allows flexible manipulation of edges and their properties during graph mutation
First Claim
1. A method comprising:
- providing a plurality of configurable strategies that can simplify edges of property graphs that include property values of edge properties of edges;
dynamically creating a variable amount of instances, including a first strategy instance and a second strategy instance and a third strategy instance, of a same configurable strategy of the plurality of configurable strategies;
dynamically identifying a first name of a first edge property and a first threshold value to configure the first strategy instance;
dynamically identifying a second name of a second edge property and a second threshold value to configure the second strategy instance;
dynamically identifying a third name of a third edge property and a third threshold value to configure the third strategy instance, wherein the first name and the second name and the third name are distinct;
selecting and configuring a strategy subset, including said variable amount of instances, of the plurality of configurable strategies to define a particular simplification scheme;
simplifying, after said configuring said strategy subset, a property graph that comprises a plurality of edges by applying the strategy subset to the property graph;
wherein the method is performed by one or more computers.
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques are provided for strategy-based graph simplification. In an embodiment, a computer provides configurable strategies that simplify edges of a graph. A client selects and configures a strategy subset of the configurable strategies to define a particular simplification scheme. The computer simplifies a graph by applying the strategy subset to the graph. In embodiments, predefined classes or other application programming interface (API) is provided to clients to obtain and customize strategy instances, such as with a factory or builder. Strategy instances may be imperative or declarative. A service implementation, such as a graph engine, may be embedded or remoted. Techniques herein provide for reuse and optimization.
34 Citations
44 Claims
-
1. A method comprising:
-
providing a plurality of configurable strategies that can simplify edges of property graphs that include property values of edge properties of edges; dynamically creating a variable amount of instances, including a first strategy instance and a second strategy instance and a third strategy instance, of a same configurable strategy of the plurality of configurable strategies; dynamically identifying a first name of a first edge property and a first threshold value to configure the first strategy instance; dynamically identifying a second name of a second edge property and a second threshold value to configure the second strategy instance; dynamically identifying a third name of a third edge property and a third threshold value to configure the third strategy instance, wherein the first name and the second name and the third name are distinct; selecting and configuring a strategy subset, including said variable amount of instances, of the plurality of configurable strategies to define a particular simplification scheme; simplifying, after said configuring said strategy subset, a property graph that comprises a plurality of edges by applying the strategy subset to the property graph; wherein the method is performed by one or more computers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause:
-
providing a plurality of configurable strategies that can simplify edges of property graphs that include property values of edge properties of edges; dynamically creating a variable amount of instances, including a first strategy instance and a second strategy instance and a third strategy instance, of a same configurable strategy of the plurality of configurable strategies; dynamically identifying a first name of a first edge property and a first threshold value to configure the first strategy instance; dynamically identifying a second name of a second edge property and a second threshold value to configure the second strategy instance; dynamically identifying a third name of a third edge property and a third threshold value to configure the third strategy instance, wherein the first name and the second name and the third name are distinct; selecting and configuring a strategy subset, including said variable amount of instances, of the plurality of configurable strategies to define a particular simplification scheme; simplifying, after said configuring said strategy subset, a property graph that comprises a plurality of edges by applying the strategy subset to the property graph. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44)
-
Specification