This project is read-only.

DBreeze completely moved to GitHub


Professional, open-source, NoSql (embedded Key / Value storage), transactional, ACID-compliant, multi-threaded, multi-paradigm database management system for .NET 3.5> / Xamarin MONO Android iOS / .NET Core / UWP (Universal Windows Platform) / .NET Portable ...for servers and internet-of-things...

Made with C#

- It's a free software for those who think that it should be free.
- It has been used in our own production environment since June 2012.
- Changes in versions document reflects important information about DBreeze evolution.
- Since January 2014 DBreeze via NuGet.
- Works on phones, tablets, desktops, servers and clouds under Linux, Windows, OS X. Via Xamarin on Android, iOS. Check downloads region.  
- DBreeze is listed in

At home || || on GitHub 

Quick start guides

Documentation (PDF, actual)

Documentation (HTML, actual)

Benchmark (HTML, actual)

Changes in versions

Discussion on the forum 

DBreeze tuning advices 

Key features:

- Fully managed code, platform independent and without reference to other libraries.
- C# (.NET) everywhere: no more SQL language mix within business logic.
- ACID compliant.
- 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. When you need, unleash DBreeze power and get 500000 key/value pairs insert or 260K updates per second per core into sorted table on the HDD of a standard PC.
- High speed of random keys batch insert and updates (batch must be sorted in memory ascending and non-overwrite flag must be set).
- Range selects / Traversing (Forward, Backward, From/To, Skip, StartsWith etc). Remove keys, change keys.
- Keys and values, on the low level, are always byte arrays.
- Max. key size is 65KB, max. value size is 2GB. Value can be represented as a set of columns, where can be stored data types of fixed or dynamic length. Every dynamic datablock can be of size 2GB.
- Rich set of conversion functions from/to between byte[] and other data types.
- Nested / Fractal tables which can reside inside of master tables values.
- Incremental backup/restore option.
- Integrated text-search subsystem (full-text/partial).
- Integrated object database layer.
- Fast multi-parameter search subsystem with powerful query possibilities.
- Different data-view representation (like TreeView/Dictionary/Hashset etc..).
- DBreeze is a foundation for complex data storage solutions (graph/neuro, object, document etc. data layers). Please, study documentation to understand all abilities of DBreeze.


website counter

Last edited Apr 11, 2017 at 10:41 AM by hhblaze, version 288