Minimalistic database

The library allows to store a value associated with a key.

The size of the value must not be larger than 1.5 MiB (1536 kiB).

The size of the key can vary and is limited by 1 kiB.

ACID is not tested well.

TODO:

• Full encryption (Adiantum).
• More tests.
• More tests for ACID.

Difficult

• B-Tree: implement table scanning.
• Extent allocation -> Unlimited value;
• Better parallelism.

lib.rs:

Database Maximal size: (2 ^ 44) B = 16 TiB Maximal key size: (2 ^ 10) B = 1 kiB Maximal number of records: 2 ^ 30