consistent hashing does: minimizes remapping when nodes join/leave

consistent hashing solves: minimizes key redistribution when servers are added/removed

Consistent hashing minimizes key redistribution when servers are added/removed

Locality-sensitive hashing

Locality-sensitive hashing (LSH) hashes similar items into the same buckets

ACID

ACID guarantees data validity in transactions

Hash table

Hash table lookup: O(1) average time complexity

BPE tokenization does: iteratively merges the most frequent adjacent byte pairs

BPE tokenization merges frequent adjacent byte pairs iteratively

database sharding does: splits data across machines by a partition key

Database sharding splits data across machines by a partition key