1. A computer-implemented method for minimizing the number of data objects and pattern matchings occurring at the nodes of a flowgraph, each data object being manifest by coded indicia, said flowgraph being of the type in which the elements of a pattern are compiled into an acrylic-directed graph of entry and join nodes (FIG. 1), each pattern including coded indicia selected from a set consisting of single and compound elements, the entry nodes representing coded indicia of the single elements of the pattern, and join nodes representing coded indicia of compound elements, said entry and join nodes being connected in pattern-directed association (FIG. 1), comprising the steps of: (a) applying the data objects to the entry nodes of said flowgraph; at each node (entry nodes and join nodes): (b) performing a comparison match between the coded indicia of the data objects and the coded indicia of the node pattern elements; (c) maintaining a list of instantiations of objects satisfying the match conditions of pattern elements expressed at that node and passing tokens to descendant nodes; (d) maintaining pointers to all ancestor nodes through which the token for each object passed; and (e) traversing said pointers as a path for avoiding those flowgraph node pattern/object matchings redundant between a previously matched object and an object currently being processed.