GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON

the champagne of beta embedded databases

A standalone and lightweight C library

A collection of classical data structures and algorithms implemented in Typescript with video lectures

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

Disk-based B+-tree written in Pure Java

🏅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

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

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

An open-source BzTree implementation

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.

SortedTables in Nim, based on B-Trees

Safe cryptographic steganographic advanced filesystem

B-tree implementation in C based on algorithm in CLRS.

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.).

C++ template containers with optimized memory consumption

Just Another Memory Mapped Database

🌲 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)

Implementation of LPRC and PSRC

Disk-based Nearest Neighbor Search

B-tree implementation in C++ to index documents based on numerical id's and title strings.

CS 564 (Spring 2019): Database Management Systems @ UWMadison - SQL Sampling; B+ Tree Index Manager; Auction Base

Key value Database using B Tree

A tiny relational database with persistent B-Tree

Code Snippets, Exercises For the Data Structures and Algorithms in Python by Goodrich, Tamassia

Disk-based Furthest Neighbor Search

Low level indexed key value engine designed for a database backed up by an on disk file storage written in C++ for educational reasons. Also used as resource for database programming tutorial at https://medium.com/ (Link in readme).

Another b-tree implementation