Entropy based nearest neighbor search in high dimensions
Consistent hashing and random trees
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA ’06
Eric Lehman
David Karger
Daniel Lewin
Matthew Levine
Tom Leighton
Immutability Changes Everything
Efficient distributed locality sensitive hashing
Building consistent transactions with inconsistent replication
Query-aware locality-sensitive hashing scheme for $$l_p$$ l p norm