b-tree

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

A standalone and lightweight C library

the champagne of beta embedded databases

🏅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 东半球最快并发索引

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

Disk-based B+-tree written in Pure Java

Just Another Memory Mapped Database

Proof of concept for geoip lookup over DAG-CBOR dataset loaded from IPFS

An open-source BzTree implementation

Benchmarking Rust key-value storage engines

🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)

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

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

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

Source codes for the Data Structures and Algorithms in C++ and Java book

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.

Data Structures and Algorithms in C++

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