search

FALCONN-LIB / FALCONN

FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
http://falconn-lib.org/
MIT License
1.14k stars 194 forks source link

Optimize probing #11

Open ilyaraz opened 8 years ago

ilyaraz commented 8 years ago

In particular, try radix sort instead of std::sort.

ludwigschmidt commented 8 years ago

Just to clarify: I guess this is for the post-probing sorting of the candidates, not the sorting in the CP hash (where we use the incremental sorter)? It would also be interesting to see whether the sorting helps at all actually. Since the DataStorage class has a prefetcher built in, the advantage of sorting might not be that large.