Paper Notes: Bitcask Key-Value Storage
Last updated on November 11, 2024 am
Paper Notes: Bitcask Key-Value Storage
J. Sheehy and D. Smith. Bitcask: A Log-Structured Hash Table for Fast Key/Value Data. Basho White Paper, 2010. https://riak.com/assets/bitcask-intro.pdf
A good storage engine should provide, as I quote from the paper:
- low latency per item read or written
- high throughput, especially when writing an incoming stream of random items
- ability to handle datasets much larger than RAM without degradation
- crash friendliness, both in terms of fast recovery and not losing data
- ease of backup and restore
- a relatively simple, understandable (and thus supportable) code structure and data format
- predictable behavior under heavy access load or large volume
References
- bitcask-intro.pdf
- Insights from Paper — Bitcask : A Log-Structured Hash Table for Fast Key/Value Data | by Hemant Gupta | Medium
- Paper Notes: Bitcask – A Log-Structured Hash Table for Fast Key/Value Data – Distributed Computing Musings
- Understanding Bitcask - A Log-Structured fast KV store
- Key-Value Storage Engines
- Bitcask论文(A Log-Structured Hash Table for Fast Key/Value Data) _阿洋 blog
- Riak’s Bitcask - A Log-Structured Hash Table for Fast Key/Value Data - High Scalability -
Paper Notes: Bitcask Key-Value Storage
https://lingkang.dev/2024/03/26/read-paper-bitcask/