Mastodon Feed
dysfun@treehouse.systems ("gaytabase") wrote:
okay please excuse the maths thoughts and bear with me here, takes hit on crack pipe
when you have an immutable data structure such as a tree map, you rewrite up the spine of the tree from where you make the change to the root, right? if you happen to query for the key you just inserted, you look up that path exactly.
if you're talking about on disk data structures, append only, you're thus looking at fewer seeks to read precisely that path because you'll have just written it in order. but by the same token you'll probably worsen literally every other path in the tree...
how do i even start to quantify this sort of effect?