bgamari/b-tree

Haskell on-disk B* tree implementation

Haskell

115

201 commits

updated Dec 9, 2021

See the code

README

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.

Contributors

bgamari

201 commits

bgamari/b-tree

Haskell on-disk B* tree implementation

Haskell

115

201 commits

updated Dec 9, 2021

See the code

README

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.

Contributors

bgamari

201 commits

Languages

Haskell

100.0%