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.
-
Notifications
You must be signed in to change notification settings - Fork 7
Haskell on-disk B* tree implementation
License
bgamari/b-tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Haskell on-disk B* tree implementation
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published