Our method outperforms the baseline on top-N sizes smaller than or equal to 300.
the top-N selection part of the search has been accelerated using hashing methods to avoid a full sort (Shi et al., 2018;Pagh and Rodler, 2004).