GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
Aug 18, 2024 - Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
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
An open-source BzTree implementation
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
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.
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.).
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
In-memory B-Tree implementation for C#
Source codes for the Data Structures and Algorithms in C++ and Java book
Add a description, image, and links to the b-tree topic page so that developers can more easily learn about it.
To associate your repository with the b-tree topic, visit your repo's landing page and select "manage topics."