In some cases where a large array is indexed and an (eg equality) match on (eg a non null value) is requested, it may be slow and unnecessary to scan the document's full array for a matching element. The existence of a matching element may be inferred from the existence of a matching index key. We'd need to carefully examine the set of cases where this optimization can be applied.