Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
hashing
Hashing in Modern Recommender Systems: A Primer
Understanding the most underrated trick in applied Machine Learning
Introduction to Locality-Sensitive Hashing
An Introduction to Hashing in the Era of Machine Learning
In December 2017, researchers at Google and MIT published a provocative research paper about their efforts into “learned index structures”…