News for hackers. Stuff that matters.
Re:An Introduction to Cache-Oblivious Data Structures by AstralStorm on Tuesday February 06, 2018 @04:27PM (#16319954)
Yes, additionally fractal trees have a predictable and compact memory structure while LSMTs are more sparse. Average case for queries is also better for fractal structure and implementation is actually easier.

There are no comments on this comment yet.