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
116 stars
9 watching
7 forks
Language: Haskell
last commit: about 3 years ago Related projects:
Repository | Description | Stars |
---|---|---|
| An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
| A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
| Enables heap inspection and analysis of running Haskell programs from an external debugger | 61 |
| A package that provides fast and efficient in-memory data structures using B-tree technology | 1,312 |
| Provides efficient tree data structures for Django web applications | 1,118 |
| Haskell bindings for an incremental parsing toolkit used in compiler development and language analysis. | 156 |
| A toolchain for designing and synthesizing digital electronic hardware | 960 |
| An interactive code editor with a live visual representation of binary trees to teach data structures and algorithms. | 180 |
| A cross-platform GUI library for writing native Haskell applications | 598 |
| A library that provides mathematical operations for JAX pytrees. | 194 |
| A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
| A Haskell library for creating hardware descriptions using a functional programming style | 98 |
| A stable B-tree data structure implementation in Motoko for storing and retrieving key-value pairs. | 10 |
| Efficient serialisation of values to and from lazy ByteStrings in Haskell. | 109 |
| An interface for reading and writing DBF files | 3 |