tag: lsm-trees
articles: 2 · beats: 1
latest: August 17, 2026
---
Lsm Trees
2 Crashtech articles on Lsm Trees, filed under System Design, published in August 2026. Every piece is full-text HTML with sources, structured data and an authored FAQ.
All 2 sit in the System Design beat. System Design
LSM-Trees vs B-Trees: Why Cassandra Chose Sequential Writes
B-trees seek random disk positions. LSM-trees buffer in memory and flush sequentially, converting random I/O into sequential writes for millions of ops/sec.
Skip Lists: The Shortcut Nobody Rotates
Balanced trees rebalance with rotations. Skip lists layer express lanes with random promotion—same O(log n) search, simpler locking.
Questions we answer about Lsm Trees
- What is the fundamental difference between LSM-trees and B-trees?
- Why does sequential disk I/O matter for write performance?
- What happens during the LSM compaction process?
- What is read amplification and how do Bloom filters fix it?
- When should I choose LSM-trees over B-trees?
- What is a skip list and how does it speed up search?
- Why do Redis sorted sets and LSM MemTables use skip lists instead of balanced trees?
- How does randomness give O(log n) worst case?
- How do you lock a skip list for concurrent inserts without rotations blocking readers?
- When should you NOT use a skip list instead of a balanced tree?
Frequently asked questions
What does Crashtech publish about Lsm Trees?
2 articles tagged Lsm Trees, the most recent published August 17, 2026. All 2 sit in the System Design beat. Each carries numbered sources, an authored FAQ and full structured data.
What questions about Lsm Trees does Crashtech answer directly?
10 questions have a dedicated answer page under this tag, including “What is the fundamental difference between LSM-trees and B-trees?”. Each answer is authored prose from the article it belongs to, not a generated summary.
Can AI assistants read Crashtech's Lsm Trees coverage?
Yes. Crashtech serves full static HTML to every crawler, allows all major AI user agents in robots.txt, and publishes an llms.txt manifest plus a full-text corpus, so assistants can retrieve and cite these articles directly.