TechHacker Noonabout 7 hours ago
Can Persistent Tries Beat LMDB? Leaves Database Benchmarked
16 min read
A persistent-trie database called Leaves outperforms LMDB by 1.5-2.2x in several standard workloads, while LMDB reaches up to 6x higher throughput than WiredTiger and SQLite in read-heavy tests. Leaves excels in lookups with O(k) complexity but loses to LMDB on long scans.
Level
Hype check
Tap to vote and see what everyone thinks.
