What is special about internal design of LMDB?
What would be the performance difference (reads/writes) between some C++ implementation of in-memory B-Tree (for example google btree) and the LMDB (without taking into consideration all the feacures of LMDB such as transactions, isolation, shared access etc.)? arielf This 2014 lmdb design presentation by its architect Howard Chu covers the design and tradeoffs of lmdb . To summarize: lmdb is a copy-on-write, bottom-up updated, double-buffered, b-tree where the implementation always favors simplicity whenever it clashes with other considerations. The smart design choices make it one of the