Determining an execution ordering
First Claim
Patent Images
1. A computer-implemented method of determining an execution ordering, comprising:
- generating a directed graph based on a hierarchy comprising a plurality of pattern queries;
determining a minimum spanning tree of the directed graph; and
determining an execution order of the pattern queries based on the minimum spanning tree.
12 Assignments
0 Petitions
Accused Products
Abstract
There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.
6 Citations
20 Claims
-
1. A computer-implemented method of determining an execution ordering, comprising:
-
generating a directed graph based on a hierarchy comprising a plurality of pattern queries; determining a minimum spanning tree of the directed graph; and determining an execution order of the pattern queries based on the minimum spanning tree. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer system for determining an execution ordering, the computer system comprising:
-
a processor that is adapted to execute stored instructions; and a memory device that stores instructions, the memory device comprising; computer-implemented code adapted to generate a directed graph based on a hierarchy comprising a plurality of pattern queries, wherein the hierarchy comprises a plurality of parent-child relationships between the plurality of pattern queries, wherein a child pattern query refines data processed by a parent of the child pattern query; computer-implemented code adapted to determine a minimum spanning tree of the directed graph; and computer-implemented code adapted to determine an execution order of the pattern queries based on the minimum spanning tree. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. A tangible, non-transitory, machine-readable medium that stores machine-readable instructions executable by a processor to determine an execution ordering, the tangible, non-transitory, machine-readable medium comprising:
-
machine-readable instructions that, when executed by the processor, generate a directed graph based on a hierarchy comprising a plurality of pattern queries, wherein the hierarchy comprises a plurality of parent-child relationships between the plurality of pattern queries, wherein a child refines data processed by a parent of the child pattern query, and wherein the directed graph comprises; a plurality of vertices corresponding to the plurality of pattern queries; a virtual ground vertex comprising a root of the directed graph; a plurality of first edges corresponding to the plurality of parent-child relationships, wherein each of the first edges is associated with a weight corresponding to a cost of processing a first pattern query, at which, the first edge is directed; and a plurality of second edges directed from the virtual ground vertex to the plurality of vertices, wherein each of the second edges is associated with a weight corresponding to a cost of processing the first pattern query, at which the second edge is directed; machine-readable instructions that, when executed by the processor, determine a minimum spanning tree of the directed graph; and machine-readable instructions that, when executed by the processor, determine an execution order of the pattern queries based on the minimum spanning tree. - View Dependent Claims (17, 18, 19, 20)
-
Specification