Re:A new take on hash array mapped tries: MariV2, a performa...
by sirgallo on Thursday February 27, 2025 @09:45AM
(#43194808)
mariv2 looks to be a direct competitor to bbolt db. Also implemented in go, it utilizes a concurrent ordered array mapped trie as the storage engine, unlike most databases which utilize a B+ or LSM tree. The design is inspired by Phil Bagwell’s Ideal Hash Tree whitepaper. The design is lock free and utilizes a version of mvcc and occ.
[ Parent
| on HN ]
There are no comments on this comment yet.