5 releases

Uses old Rust 2015

0.10.0 Aug 7, 2020
0.9.4 Feb 25, 2020
0.9.2 Jan 16, 2019
0.9.1 Oct 26, 2018
0.9.0 Oct 17, 2018

#113 in Database implementations

Download history 16/week @ 2024-07-22 18/week @ 2024-07-29 17/week @ 2024-08-05 12/week @ 2024-08-12 10/week @ 2024-08-19 37/week @ 2024-08-26 17/week @ 2024-09-02 10/week @ 2024-09-09 10/week @ 2024-09-16 59/week @ 2024-09-23 20/week @ 2024-09-30 4/week @ 2024-10-07 27/week @ 2024-10-14 4/week @ 2024-10-21 5/week @ 2024-10-28 22/week @ 2024-11-04

58 downloads per month
Used in 8 crates

MIT license

345KB
6.5K SLoC

cannyls

Crates.io: 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.

Documentation

Dependencies

~4MB
~81K SLoC