&quot;Sequential synchronous random writes&quot; means that you issue writes with random keys in sequence, waiting for each to be synchronously written to durable storage before writing the next.  This is an important metric in certain domains, and it is generally bound by the underlying hardware regardless of database architecture (though certain designs can make it much worse).<p>How does LMDB outperform log-structured databases when writing page-sized objects with random keys when the working set is larger than RAM?  I&#x27;m genuinely curious.  Any other Btree-based database will perform at disk read seek rates, at best.