We can encounter sargable predicates that are not expressed as index bounds but as MatchExpressions. Assuming the leaf expressions reference paths which have corresponding histograms, we can use them to generate cardinality estimates.