3 ms·
Performing the intersection of sorted lists is a well studied problem in information retrieval, so nothing new or surprising here... The performance can be imp
by gorset 15y ago
Performing the intersection of sorted lists is a well studied problem in information retrieval, so nothing new or surprising here...
The performance can be improved even further by for example using a compressed integer list with an embedded skip list or by using compressed bitmaps. Using sorted int32 lists is the naive solution :-)
- alecco 15y agoIt's not that simple. Those solutions for easy lookup often require certain types of distributions. For example to use compression of the style of PFOR/PFOR-Delta. If compression isn't 1-to-1 in some way, lookup becomes a lot harder.