Researching a disk based hash table

added by DotNetKicks
11/14/2019 6:11:15 PM

257 Views

There is a specific scenario that I run into that could be really helped by an O(1) lookup cost on a disk persistent data structure. Voron, our storage engine library, is built on top of a whole big pile of B+Trees, which has an O(logN) lookup cost.


0 comments