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.
$ dotnet add package FriendlyCSharp.DatabasesNo README available.