23 packages tagged with “BTree”
==CSharpTest.Net.Collections== * BPlusTree - a fairly full featured IDictionary backed by a B+Tree on disk. * BTreeDictionary - a fully in-memory IDictionary implemented by a B+Tree. * BTreeList - an in-memory IList using a B+Tree for storage and access. * LurchTable - Least Used Recently Concurrent Hash Table, LinkedHashMap but thread-safe. * MergeSort - Provides a memory-efficient sort for arrays. * OrderedEnumeration & OrderedKeyValuePairs - Ordered enum of large volumes of key-values. * OrdinalList - A simple byte[] based bit-mask collection supporting set operations.
==CSharpTest.Net.BPlusTree== This library is a fairly full featured IDictionary<TKey, TValue> implementation backed by a B+Tree on disk. The instance is thread-safe and supports a form of MVCC (Multi Version Concurancy Control) to support non-blocking reads. Great for storing a local cache or use it as a completly local stand-alone database. DEPRECATED: Source moved to: https://github.com/csharptest/CSharpTest.Net.Collections Package moved to: https://www.nuget.org/packages/CSharpTest.Net.Collections
Data structure library
This package provides an in-memory B-Tree implementation for C#, useful as an ordered, mutable data structure.
High-performance, memory-efficient collections for .NET. Right now, the package has a fast, compact B-tree based on Google's C++ B-tree library. Other collections are coming soon!
BTree offers a simple and high performant implementation of a BTree and a B+Tree (BPlusTree) for C# and .NET.
KaosCollections is a .NET library that provides generic collection classes for storing elements that are both sorted and indexed. Two of these classes emulate Microsoft's SortedDictionary and SortedSet while delivering superior performance and greatly enhanced capability. Also included are sorted bag and a map classes. Based on order statistic B+ trees, all classes provide getting elements by index, getting the index of an element, range removal by index, range enumeration, and more. Primary types provided are: Kaos.Collections.RankedDictionary<TKey,TValue> Kaos.Collections.RankedSet<T> Kaos.Collections.RankedMap<TKey,TValue> Kaos.Collections.RankedBag<T>
High-performance B+Tree index engine for .NET. Works with MemoryStream or FileStream, fixed-size pages, and deterministic memory use. Suitable for embedded systems, POS terminals, kiosks, scanners, and edge devices. Supports balanced insert/erase, leaf-chain traversal, and deferred flush write-back caching. Ideal for KV stores, embedded storage engines, OLTP index tables, queue logs, and append-only logs.
Generic B-tree written in C#, which can be replaced with NoSQL database stored in the memory. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data.
BTree-非典型的高性能行为树实现
行为树Codec包
Scalable Objects Persistence (SOP) - High-performance transactional storage engine.
SQL tokenizer, recursive-descent parser, and AST for the CSharpDB embedded database.
Query planner, operator tree, and expression evaluator for the CSharpDB embedded database.
B+tree storage engine with page cache, write-ahead log (WAL), crash recovery, and concurrent snapshot-isolated readers.
Lightweight embedded SQL database engine for .NET. Single-file storage, WAL durability, concurrent readers, and a typed Collection<T> NoSQL API.
Shared types, schema definitions, and error codes for the CSharpDB embedded database engine.
ADO.NET provider for CSharpDB. Standard DbConnection, DbCommand, and DbDataReader with parameterized queries and transactions.
Thread-safe service layer for hosting CSharpDB in ASP.NET Core, Blazor, or MCP server applications.
Read-only storage diagnostics toolkit for CSharpDB database and WAL files.
High-performance embedded key-value database engine for .NET. Features B+Tree and LSM-Tree storage engines, MVCC transactions, AES-256-GCM encryption, and full ACID compliance.
A library for all the data structures in C#. Every class is generic and reusable.