DBreeze

Key Features

* Fully managed code, platform independent and without reference to other libraries. * Multi-threaded, with a solution for deadlocks resolving/elimination, parallel reads and synchronized writes/reads. * No fixed scheme for table names (construction and access on the fly). * Tables can reside in mixed locations: different folders, hard drives, memory. * Liana-Trie indexing technology. Database indexes (keys) never need to be defragmented. Speed of insert/update/remove operations doesn't grow up during the time. * Ability to access Key/Value pair of a table by physical link, what can economize time for joining necessary data structures - approach of Graph Databases. * No limits for database size (except "long" size for each table and physical resources constraints). * Low memory and physical space consumption, also while random inserts and updates. Updates reside the same physical space, if necessary. * High performance of CRUD operations. * High speed of random keys batch insert and updates (batch must be sorted in memory ascending and non-overwrite flag must be set). * Nested / Fractal tables which can reside inside of master tables values. * Incremental backup/restore option. * Integrated text-search subsystem (full-text/partial). * DBreeze is a foundation for complex data storage solutions (graph/neuro, object, document, text search etc. data layers). Please, study documentation to understand all abilities of DBreeze.