ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
-
Updated
May 29, 2024 - C#
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
an awful little SQL database implementation
This B-Tree implementation offers efficient insertion, deletion, and search operations on large datasets. Perfect for handling sorted data, it provides fast and balanced tree-based storage, making it an essential for dealing with vast amounts of structured information.
Graphs, graph algorithms, trees and other subjects
In-memory B-Tree implementation for C#
A C# implementation of the classic data structure
Library for general storage tasks, such as B-Trees, using .net standard.
Proyecto de Estructuras de Datos I de la Universidad Rafael Landivar
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."