MotokoStableBTree
B-tree
A stable B-tree data structure implementation in Motoko for storing and retrieving key-value pairs.
https://forum.dfinity.org/t/icdevs-org-bounty-24-stablebtree-mokoko-up-to-10k/14867
10 stars
3 watching
8 forks
Language: Motoko
last commit: over 1 year ago
Linked from 1 awesome list
ic123-xyz/awesome-motokoRelated projects:
| Repository | Description | Stars |
|---|---|---|
 begeekmyfriend/bplustree | A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
 canscale/stablerbtree | An implementation of a stable data structure based on Red Black Trees in the Motoko programming language. | 3 |
 chenyan2002/motoko-splay | A library implementing a data structure used to efficiently retrieve and insert elements in a binary search tree. | 1 |
 bgamari/b-tree | An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
 benedikt/mongoid-tree | A Mongoid document extension for building tree structures with a materialized path pattern | 302 |
 wyhaines/splay_tree_map.cr | A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
 aviate-labs/sorted.mo | A collection of data structures implemented in Motoko to facilitate sorted ordering and insertion. | 4 |
 jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
 matthewhammer/motoko-sequence | A library for building persistent sequential data structures | 15 |
 martibosch/detectree | A Pythonic library for semantic tree segmentation from aerial imagery | 243 |
 jtsiomb/kdtree | A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space | 396 |
| canscale/stableheapbtreemap | A library implementing a functional BTree data structure | 5 |
 attaswift/btree | A package that provides fast and efficient in-memory data structures using B-tree technology | 1,312 |
 vidalt/ba-trees | Transforms random forests into minimal-size trees with the same prediction function across the entire feature space. | 64 |
 tnballo/scapegoat | A library providing a safe and efficient data structure for ordered sets and maps with memory-efficient and self-balancing properties. | 255 |