(2004), where any 3L documents were used, we compare to the 3L documents that collide most frequently with the new document.
if S is the set of all documents that collided with a new document in all L hash tables, we order the elements of S according to the number of hash tables where the collision occurred.