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

  1. bitcask-intro.pdf
  2. Insights from Paper — Bitcask : A Log-Structured Hash Table for Fast Key/Value Data | by Hemant Gupta | Medium
  3. Paper Notes: Bitcask – A Log-Structured Hash Table for Fast Key/Value Data – Distributed Computing Musings
  4. Understanding Bitcask - A Log-Structured fast KV store
  5. Key-Value Storage Engines
  6. Bitcask论文(A Log-Structured Hash Table for Fast Key/Value Data) _阿洋 blog
  7. 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/
Author
Lingkang
Posted on
March 26, 2024
Licensed under