CEP question - I have a series of a dozen or so events that works great in detecting "perfect" matches (ie. all dozen events happen in sequence with the proper characteristics). I am trying to add partial matches, using the optional condition to each of the events in the sequence. In my use case, I want to return the "best" match, the one that has the most matching events, possibly even the perfect match. I can accomplish this with noSkip() strategy and some post processing to keep only the best match, but that is super slow at scale (searching for numerous patterns simultaneously through potentially millions of events). I would like to use the skipToLast or skipPastLast strategies, which works great (and incredibly fast) in my perfect match working case. But those skip strategies accept the quickest match (worst match in my use case) and then skip preventing it from even matching on the "best" match. Is there a way (or could there be a way in a future release) to encourage the CEP engine to attempt to find the entire pattern (even with optionals), such that the most complete instance would be returned rather than the first one meeting the least criteria? Thanks!