Haskell on-disk B* tree implementation
Switch branches/tags
Clone or download
bgamari Don't rely on MonadFail
The refutable matches that existed were in principle impossible anyways.
Latest commit 8ca56f5 Nov 4, 2018


b-tree - Disk-backed B* trees

b-tree is a Haskell implementation of a disk-backed B* tree. The library uses streaming IO to write an immutable B-tree to disk from ordered keys. This tree can then be opened via mmap for lookups. The tree can also be iterated over as well as merged with other trees and leaf sources.