-
redb
Rust Embedded DataBase
-
im
Immutable collection datatypes
-
btree-range-map
B-tree range map implementation
-
imbl
Immutable collection datatypes
-
btree-slab
A memory compact Slab-based B-tree implementation
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
submap
B-Tree map for pub/sub services
-
btree-vec
A growable array (vector) implemented using a B-tree
-
masstree
A high-performance concurrent ordered map (trie of B+trees) - alpha release, not production ready
-
raw-btree
Generic B-Tree implementation
-
manifold-db
Manifold Embedded Database
-
zed-sum-tree
A sum tree data structure, a concurrency-friendly B-tree
-
superset_map
Map that stores distinct supersets based on the total order defined
-
cranelift-bforest
A forest of B+-trees
-
saferlmdb
An almost-safe, near-zero-cost, feature-complete, unabashedly non-abstract wrapper around LMDB
-
brie-tree
A fast B+ Tree implementation that uses integer keys
-
wt-indexset
Fork of original indexset which is used for worktable
-
byodb-rust
Build Your Own Database in Rust!
-
quill-sql
A tiny yet serious SQL database in Rust with ARIES-style WAL, 2PL, and B+Tree indexes
-
generic-btree
Generic BTree for versatile purposes
-
redbx
Rust Embedded DataBase with AES Encryption - Fork of redb
-
gpui_sum_tree
A sum tree data structure, a concurrency-friendly B-tree
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
btree-ondisk
BTree structure on persistent storage in userspace
-
lmdb-zero
An almost-safe, near-zero-cost, feature-complete, unabashedly non-abstract wrapper around LMDB
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
nebari
ACID-compliant database storage implementation using an append-only file format
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
pak-db
A read-only database format designed for speed, ease of use and data sharing
-
xi-rope
A generic rope data structure built on top of B-Trees
-
hicollections
C-liked Collections
-
btreemultimap
A multimap implementation with range support
-
weak-map
BTreeMap with weak references
-
limousine_engine
can reason about a large design continuum of hybrid key-value store designs and materialize an optimal implementation using procedural macros
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
btreecap
BTree with configurable capacity limits and overflow policies
-
cobt
A Cache-Oblivious B-Tree implementation in Rust
-
copse
Direct ports of the standard library’s BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the
Ordtrait -
bztree
BzTree implementation for Rust
-
btree-plus-store
B-trees backed by a slab/arena to reduce allocations and increase locality + copyable, immutable B-trees which must be manually dropped
-
option-entry
EntryforOption -
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
ledb
Lightweight embedded database built over LMDB
-
limousine_core
Building blocks for hybrid index data structures
-
yakv
persistent key-value storage based on B-Tree
-
b-tree
A persistent B+ tree using freqfs
-
content-tree
An efficient data structure for compacted RLE data
-
hyperbee
Peer to Peer B-tree
-
ABtree
AVL and Btree for rust
-
rax
Rust wrapper for the ANSI C Radix Tree "rax" https://github.com/antirez/rax implementation used in Redis
-
baildon
B+Tree library
-
parity-db
Key-value database for the blockchain
-
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
arbutus
Trees
-
indextreemap
A BTreeMap implementation that allows for key and or positional insertion and retreival
-
tc-collection
TinyChain's collection types
-
pigdb
Key-value database for the blockchain
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
worker-ratelimit
General purpose rate limiting library for Cloudflare Workers
-
llkv-btree
Generic, paged B+Tree with batch-only pager I/O for the LLKV toolset
-
sakurai
Performant, general-purpose data structures
-
ord-lmdb-zero
An almost-safe, near-zero-cost, feature-complete, unabashedly non-abstract wrapper around LMDB
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
robt
Read only, immutable Btree for indexing key,value
-
qpdb
High-performance embedded storage engine
-
treers
Sedgewick's tree maps
-
bittree
O(1) find functions in a special data structure called a bit tree
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
mintkv
kv library based on btree
-
treesome
tree creation, manipulation, traversal and visualization
-
sorting-vec
Sorts a vector using a btreemap
-
sixarm_collections
Collections for HashMapToSet and BTreeMapToSet as trait extensions. By SixArm.com.
-
flash-kv
k/v store API inspired by bitcask
-
submerge
Experimental database thing
-
btreec
Rust bindings for btree.c
-
intersection
Find the intersection over a collection of sets; when you need more than the intersection between two sets
-
observable-btree
Reactive Observable BTree
-
sqlite-decoder
SQLite WAL and database formats decoder
-
histree
A framework for disk-based historical indices
-
bitkv-rs
k/v store API inspired by bitcask
-
btreemultimap-value-ord
A multimap based on the BTreeMultimap where multiple copies of a value are stored only once
-
observable-tree
Reactive Observable BTree
-
tree_multiset
A tree-based multiset for Rust
-
collectables
collections helpers for BTreeMap, BTreeSet, HashMapSet, etc. By SixArm.com.
-
toboggan-kv
abstraction layer over multiple KV stores
-
vector-trees
Vector backed B and AVL trees
-
sqlite-table
SQLite inpection and manipulation on tables
-
speedytree
Canonical and RapidNJ implementations of Neighbor-joining in Rust
Try searching with DuckDuckGo.