Currently the CE caching detects if an IntervalBounds is equivalent to a MatchExpression by generating a MatchExpression from the IntervalBounds, and then invoking MatchExpression recursive equivalence check.

CE cache efficiency can be improved by avoiding the ME generation step, and instead check if IntervalBounds is directly equivalent to the ME by walking the two structures in parallel. This would avoid memory allocation, and would reduce 2 walks or more into 1.

The approach may require a normalization step unless it is already done by some previous processing step.