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:49PM (#18203231)
I could either figure out how Judy works, or review another three papers :)
Re:Masstree: A cache-friendly mashup of tries and B-trees by leiroigh on Saturday October 13, 2018 @09:10AM (#18207763)
:)

My super high-level partial understanding of Judy is the following:

Start with ART, which is pretty simple. Then do the obvious improvements: First, we want fast access to "element number N in sorted order", i.e. you also store number of descendants. Next, you do key compression: Storing the portion of the key that can be reconstructed from the tree traversal is silly. Next: an 8-bit tag for signaling one out of 4 node types? Are you, like, filthy rich? More node types it is. Next: Spending 64 bit for a node pointer? Are you crazy? Put the type-tag into the parents pointer (earlier resolution of the branch!), and use a custom allocator to get smaller pointers (you allocate big segments and your node pointers are offsets).

You end up with an unintelligible monstrosity. Give it a cute name, forget about SIMD because it is 2001, and you end up with something like Judy.