returned for Tags:"BTree"
* 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...
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...
2,651 total downloads
Data structure library
2,293 total downloads
Simple C# caching library including a FIFO and LRU cache
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!
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...
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...
A library for all the data structures in C#. Every class is generic and reusable.