Another problem is that the sorted sets being intersected should have similar lengths because the achievable speedup is reduced if some of the k merges finish earlier. For these two reasons, we focus on the second option: exploiting SIMD instructions to speed up the intersection of two sorted sets.