Why it matters

Skip lists give O(log n) with simpler code than trees. Redis uses.

Advertisement

The architecture

Coin flip promotion.

Multiple levels of links.

Search top-down.

Skip list operationsCoin flippromotionMultiple levelsof shortcutsSearch top-downO(log n) probabilisticPugh 1990; Redis Sorted Sets use skip list; simple concurrent variants
Skip list operations.
Advertisement

How it works end to end

Pugh 1990.

Redis ZSET.

Concurrent variants exist.