⚠️ This library is in active development: there is currently no release schedule!
lsm-tree is a project that is developed by Well-Typed LLP on behalf of Input
Output Global Inc (IOG). The main contributors are Duncan Coutts, Joris Dral,
and Matthias Heinzel.
The lsm-tree library is a Haskell implementation of log-structured
merge-trees, based on
Monkey, that provides an
on-disk key-value store.
It has a number of custom features that are primarily tailored towards
performant disk IO in the Haskell implementation of the Ouroboros-family of
consensus algorithms, which can be found in the ouroboros-consensus
repository. Nevertheless,
this library should be generally useful for projects that require an on-disk
key-value store.
This library only supports 64-bit, little-endian systems. On Windows, the library only works probably on drives with NTFS.
Provide the -threaded flag to executables, test suites and benchmark suites if you use this library on Linux systems.