DBreeze
DBreeze database key features: - Embedded .NET family assembly, platform independent and without references to other libraries. - Multi-threaded, ACID compliant, 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, in-memory with disk persistence. - Liana-Trie indexing technology. Database indexes (keys) never need to be defragmented. Speed of insert/update/remove operations doesn't change during the time. - Ability to access Key/Value pair of a table by physical link, that can economize time for joining necessary data structures. - 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, when possible or configured. - 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 hard drive of standard PC (benchmark in year 2012). - High speed of random keys batch inserts and updates (update mode is selectable). - 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 (BLOB) 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. - Integrated Vector Database and vector similarity search engine (embedding vectors store/search). - Integrated binary and JSON serializer Biser.NET - High Availability, Redundancy and Fault Tolerance via Raft.NET - 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. hhblaze@gmail.com
Activity
- Latest release
- 3mo ago
- Total releases
- 95
- Cadence
- ~10 days
- Last 12 months
- 21
Reach
- Stars
- —
Details
- First release
- Jan 30, 2014
| Version | Released | |
|---|---|---|
1.138.2026.603
minor
| ||
1.137.2026.422
minor
| ||
1.136.2026.403
minor
| ||
1.136.2026.326-beta
pre
| ||
1.136.2026.323-beta
pre
| ||
1.135.2026.313
minor
| ||
1.134.2026.304
minor
| ||
1.133.2026.304
minor
| ||
1.132.2026.220
minor
| ||
1.131.2026.220
minor
| ||
1.130.2026.220
minor
| ||
1.129.2026.220
minor
| ||
1.128.2026.220
minor
| ||
1.127.2026.220
minor
| ||
1.126.2026.219
minor
| ||
1.125.2026.216
minor
| ||
1.124.2026.212
patch
| ||
1.124.2026.211
minor
| ||
1.123.2026.201
minor
| ||
1.122.2026.128
minor
| ||
1.121.2026.128
minor
| ||
1.120.2025.507
minor
| ||
1.119.2025.403
minor
| ||
1.118.2024.1016
minor
| ||
1.117.2024.627
minor
| ||
1.116.2024.527
minor
| ||
1.115.2023.1103
minor
| ||
1.114.2023.1016
minor
| ||
1.108.0
minor
| ||
1.107.0
minor
| ||
1.106.0
minor
| ||
1.105.0
minor
| ||
1.104.0
minor
| ||
1.103.0
minor
| ||
1.102.0
minor
| ||
1.101.4
patch
| ||
1.101.3
patch
| ||
1.101.2
patch
| ||
1.101.1
patch
| ||
1.101.0
minor
| ||
1.100.0
minor
| ||
1.99.0
minor
| ||
1.98.0
minor
| ||
1.97.0
minor
| ||
1.96.0
minor
| ||
1.95.0
minor
| ||
1.94.0
minor
| ||
1.93.0
minor
| ||
1.92.0
minor
| ||
1.91.6
patch
|