Taken to it's logical extreme: k-Ary Search on Modern Processors https://people.mpi-inf.mpg.de/~rgemulla/publications/schlegel09search.pdf https://people.mpi-i

Taken to it's logical extreme: k-Ary Search on Modern Processors https://people.mpi-inf.mpg.de/~rgemulla/publications/schlegel09search.pdf https://people.mpi-inf.mpg.de/~rgemulla/publications/schlege... As SSE/AVX registers get wider and wider you might as well compare an entire cache line (or two) at a time. But the overhead of building the level order k-tree means you need to do a whole lot of lookups for each insert... so it doesn't apply to that many problems. Unless you're building a search engine. Then it applies a lot.