News for hackers. Stuff that matters.
Re:Masstree: A cache-friendly mashup of tries and B-trees by HenryR on Friday October 12, 2018 @01:48PM (#18203228)
I don't know of one, but it's such a natural idea that I'd guess it's been studied. There are standard implementations of LRU caches that use e.g. a hash map and a linked list to get both fast lookup and ordering, but for real performance I think you'd want to try and minimise the number of data structures to avoid having competing cache behaviours.

There are no comments on this comment yet.