CQL - Pattern Matching Performance Question
Scenario:
Suppose I have a processor that has a MATCH RECOGNIZE of A B C D
and every minute I have 1000 events of A and B, but C and D is not always arriving.
Question:
I understand that CQL stores A and B or C somewhere in CEP,
Is there a mechanism like garbage collection in CEP that disposes the
events A and B so that the memory use of CEP will not be that great?