GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

the champagne of beta embedded databases

A standalone and lightweight C library

🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes

the fastest in-memory index in the East 东半球最快并发索引

Just Another Memory Mapped Database

A pure Rust database implementation using an append-only B-Tree file format.

An embedded key-value store library specialized for building state machine and log store

Disk-based B+-tree written in Pure Java

B-tree generator for C

An open-source BzTree implementation

geoip lookup over DAG-CBOR dataset loaded from IPFS

GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

Embedded persistent key-value store for .NET. Pure C# code.

GPU B-Tree with support for versioning (snapshots).

This is an extension of Immutable.js that provides sorted collections SortedMap and SortedSet. The current implementation is using highly optimized B-tree memory structure.

Generic data structure using parameterized types in Golang.

Benchmarking Rust storage engines

ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree

A library of cross platform C# data structures. Generic B-tree written in C#, which can be replaced with NoSQL database stored in the memory of discharge requirements in real-time (Firebase, Redis Cache, SAP HANA, Exadata, OLTP, etc.).