Currently, the plan produces an ArraySet with local key values, including arrays, unwinds it and then creates an index bound for each unique value and possibly for the first element of each array. The latter might create a duplicated index seek and we avoid it by filtering this branch out in case of key value duplication. This is brittle and probably not the most efficient way. We should consider refactoring the plan to have more robust deduplication of index bounds.