b-tree

B-tree library

An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying.

Haskell on-disk B* tree implementation

GitHub

116 stars
9 watching
7 forks
Language: Haskell
last commit: almost 5 years ago

Related projects:

RepositoryDescriptionStars
haskell/critbitAn implementation of crit-bit trees for efficient key/value storage and lookup in Haskell138
begeekmyfriend/bplustreeA minimal B+Tree indexing structure implementation for efficient key-value storage1,866
bgamari/ghc-debugEnables heap inspection and analysis of running Haskell programs from an external debugger61
attaswift/btreeA package that provides fast and efficient in-memory data structures using B-tree technology1,312
django-treebeard/django-treebeardProvides efficient tree data structures for Django web applications1,118
tree-sitter/haskell-tree-sitterHaskell bindings for an incremental parsing toolkit used in compiler development and language analysis.156
b-lang-org/bscA toolchain for designing and synthesizing digital electronic hardware960
brandonarmand/binariAn interactive code editor with a live visual representation of binary trees to teach data structures and algorithms.180
fjvallarino/monomerA cross-platform GUI library for writing native Haskell applications598
google/tree-mathA library that provides mathematical operations for JAX pytrees.194
wyhaines/splay_tree_map.crA data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items15
blarney-lang/blarneyA Haskell library for creating hardware descriptions using a functional programming style98
sardariuss/motokostablebtreeA stable B-tree data structure implementation in Motoko for storing and retrieving key-value pairs.10
haskell/binaryEfficient serialisation of values to and from lazy ByteStrings in Haskell.109
kalimehtar/binary-class-dbfAn interface for reading and writing DBF files3