Project Sherlock

Paper

1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web

David Karger et al.

Introduces a hashing scheme in which adding or removing a server relocates only a small fraction of keys, the mechanism nearly every sharded system since has relied on.

Read it

Before you start

FreeAdvancedlink checked 17 Sept 2026

Groundwork for

Works in the library that name this one as a prerequisite.

Filed under Distributed Systems in Computer Science.