Embedded persistent key-value storage optimized for random-access workload and huge-capacity HDD

3 releases

0.9.2 Jan 16, 2019
0.9.1 Oct 26, 2018
0.9.0 Oct 17, 2018

#4 in Database implementations

Download history 4/week @ 2018-10-06 62/week @ 2018-10-13 97/week @ 2018-10-20 74/week @ 2018-10-27 91/week @ 2018-11-03 27/week @ 2018-11-10 15/week @ 2018-11-17 12/week @ 2018-11-24 77/week @ 2018-12-01 57/week @ 2018-12-08 18/week @ 2018-12-15 17/week @ 2018-12-22 16/week @ 2018-12-29 200/week @ 2019-01-05 227/week @ 2019-01-12

311 downloads per month
Used in 8 crates

MIT license


cannyls cannyls Documentation Build Status License: MIT

CannyLS is an embedded and persistent key-value storage optimized for random-access workload and huge-capacity HDD.

CannyLS mainly has following features:

  • A local storage for storing objects that called as "lump":
    • Basically, a lump is a simple key-value entry
    • The distinctive properties are that the key is fixed length (128 bits) and suited for storing a relatively large size value (e.g., several MB)
  • Provides simple functionalities:
  • Optimized for random-access workload on huge-capacity HDD (up to 512 TB):
  • Aiming to provide predictable and stable read/write latency:
    • There are (nearly) strict upper bounds about the number of disk accesses issued when executing operations
      • One disk access when PUT and DELETE, and two when PUT
    • There are no background processings like compaction and stop-the-world GC which may block normal operations for a long time
    • For eliminating overhead and uncertainty, CannyLS has no caching layer:
      • It uses Direct I/O for bypassing OS layer caching (e.g., page cache)
      • If you need any caching layer, it is your responsibility to implement it
  • Detailed metrics are exposed using Prometheus

See Wiki for more details about CannyLS.



~68K SLoC