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

consistent hashing does: minimizes remapping when nodes join/leave

How can we efficiently share resources without constant reorganization?

Locality-sensitive hashing

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

ACID

ACID guarantees data validity in transactions

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

Why can't you just split a huge library into smaller ones?

Hash table

Hash table lookup: O(1) average time complexity