a fast key-value storage engine based on Append-Only B+tree
The typical key-value storage engine based on B+tree is the Kyoto Cabinet TreeDB, but the Kyoto Cabinet TreeDB use hashDB to store its nodes, so the performance is so bad in the case of massive data, so I developed another treeDB to optimize storage performance.
- Batch-write to reduce I/O frequency
- Append-Only to guarantee sequence write
- Cache-Oblivous B+ tree to speed up
TODO
FastDB v2.0 use buffer-tree.