A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage

Fast sorted collections for Swift using in-memory B-trees

An on-disk B+tree for Python 3

An persistent relational database built in Go.

Forensics tool for NTFS (parser, mft, bitlocker, deleted files)

Go datastructures.

B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go

Berkeley DB

A persistent B+Tree (clustered index) implementation in Rust.

Modern C++ B-tree containers

B-tree implementation for Go

Disk-based B+-tree written in Pure Java

The AriaSQL relational database management system.

Greg's Template Library of useful classes.

An efficient, conscise, and simple implementation of a purely on-disk B+ Tree data structure

Indexes your Python objects for fast lookup by their attributes.

TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.

KVStore is a simple Key-Value Store based on B+Tree (disk & memory) for Java

Java implementation for Introduction to Algorithms book.

A fast, disk-based BTree package with an extensive easy-to-use API optimized for large keys with many values.