Static search trees: 40x faster than binary search (2024)

This article discusses the optimization of a static search tree (S-tree) for high-throughput searching of sorted data. The author implements various optimizations, including batching, prefetching, and manual SIMD instructions, to improve the performance of the S-tree.