Alexey Dokuchaev
79f5a70721
Summary of the most important changes since version 1.2.14:
- Removed ability to manage sorted arrays as key values due
to performance issues; replaced with two-part compound keys
+ Added support of variable-length encoded integer keys
+ Added atomic in-place integer key value increments
+ Added new utility functions and flags
* Fixed incorrect key handling in iwkv_del()
* Fixed iwkv_cursor_copy_key() which was not aware of the
compound keys mode
* Fixed iwkv_puth() was called with incorrect previous value
* Fixed deadlocks in iwkv_del() by not escalating exclusive
lock on the storage
* Fixed iwxstr_new2() with zero size argument caused illegal
memory write
* Fixed memory leak in iwkv_cursor_open() on error
* Fixed high CPU usage in WAL mode
Requested by: upstream
17 lines
675 B
Plaintext
17 lines
675 B
Plaintext
IOWOW is persistent key-value database engine based on skip list data
|
|
structure. Some of its features and limitations:
|
|
|
|
- Support of multiple key-value databases within a single file
|
|
- Native support of integer keys
|
|
- Write Ahead Logging (WAL)
|
|
- Support of record values represented as sorted array of integers
|
|
- Ultra-fast sequential traversal of database records
|
|
- Compound keys support
|
|
- Good performance comparing to main competitors (LMDB, LevelDB,
|
|
Kyoto Cabinet)
|
|
- Tiny C11 library (200 KB), easily embeddable into any software
|
|
- Maximum storage file size is 512 GB, maximum size of a single
|
|
key+value record is 255 MB
|
|
|
|
WWW: http://iowow.io/
|