Intersection of sorted lists is a cornerstone operation in many applications including search engines and databases because indexes are often implemented using different types of sorted structures. At GridDynamics, we recently worked on a custom database for realtime web analytics where fast intersection of very large lists of IDs was a must for good performance. From a functional point of view, w
![Fast Intersection of Sorted Lists Using SSE Instructions](https://cdn-ak-scissors.b.st-hatena.com/image/square/0f06145798da0c2fbec95b67e1af0a83f693b942/height=288;version=1;width=512/https%3A%2F%2Fhighlyscalable.files.wordpress.com%2F2012%2F05%2Frolling-processing1.png)