Why do Redis sorted sets and LSM MemTables use skip lists instead of balanced trees?
Skip lists are simpler to implement and reason about, but the real win is concurrency. Insertion touches only a few forward pointers; no tree rotations cascade through multiple branches. This makes lock-free implementations dramatically simpler. Redis ZSET uses skip lists alongside hash tables for range queries and scoring; LSM MemTables use them to keep writes sorted in memory with minimal locking.
Answered in
Skip Lists: The Shortcut Nobody RotatesBalanced trees rebalance with rotations. Skip lists layer express lanes with random promotion—same O(log n) search, simpler locking.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.