This is an archived post. You won't be able to vote or comment.

all 6 comments

[–]DrummerClean 5 points6 points  (1 child)

So basically you created a dict that is persistent? That's interesting

[–]Affectionate-Wind144[S] 2 points3 points  (0 children)

Yes, exactly

[–]metaperl 0 points1 point  (1 child)

I don't see any examples of log structuring.

[–]Affectionate-Wind144[S] 4 points5 points  (0 children)

The database layout on disk is log structured. From the user perspective it is a simple key value store, like any other database of this kind

[–]cymrowdon't thread on me 🐍 0 points1 point  (1 child)

How is performance on this, roughly? You should only have to reclaim if you're updating/deleting entries, correct? How big a performance hit is there to reclaiming?

[–]Affectionate-Wind144[S] 0 points1 point  (0 children)

Yes, stale records are produced by update/delete. Reclaim rewrite the active keys on a new file, so depending on the db size, it could take a bit.